1225 search results - page 3 / 245 » The Instance Complexity Conjecture |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the num...
ASPDAC
2000
ACM
13 years 12 months ago
2000
ACM
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...