351 search results - page 2 / 71 » A Survey of Lower Bounds for Satisfiability and Related Prob... |
STOC
1999
ACM
13 years 10 months ago
1999
ACM
COCO
2005
Springer
13 years 11 months ago
2005
Springer
RSA
2006
13 years 5 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
NETWORKS
2006
13 years 5 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...