73

Answers
votes newest views recent
5
An optimization problem, non complete bipartite graph and hungarian algorithm
2
Finding optimal vertex partitioning of graphs to maximize cohesion and minimize coupling
3
finding numbers at k hamming distance
5
Algorithm for k-medians in a convex polygon
0
Idiosyncratic characterizations of $\ell^p$, for $p\not=1,2,\infty$
2
Optimal binary code for points in a metric+probability space
1
Relationship between these two probability mass functions.
0
Maximum average value within a rectangular bounding box
2
Preferred embedding of finite metric spaces in riemaniann manifolds of given dimension
1
Analyzing Weighted Set-Cover variant
0
Nodes clusters with a distance matrix
6
What is the easiest randomized algorithm to motivate to the layperson?
2
Permutations with identical objects
3
Suggest effective heuristic (not precise) graph colouring algorithm
6
Is the solution bounded Diophantine problem NP-complete?
1
What is the most general class of metric spaces for which the closest pair of points in a finite subset can be found in time O(n^(1+eps))?
2
nonasymptotic complexity results
7
Why relativization can’t solve NP !=P?
1
Most ‘obvious’ open problems in complexity theory
1
Practical use of probability amplification for randomized algorithms
4
What are the most important results (and papers) in complexity theory that every one should know?
0
Recovering joint distribution from marginals
7
Algorithm for embedding a graph with metric constraints
1
Measures of the complexity of a metric
9
EXPTime algorithms
1
Applications of minmax theorem(s)
1
How to solve Linear Programming problem with tighter Integer Programming constraints
5
Lower Bounds in Theoretical Computer Science
0
Geometric imagination of differential forms
6
Is there a standard measure for how close a matrix is to being a distance metric ?
1 2 3 next