1225 search results - page 2 / 245 » The Instance Complexity Conjecture |
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
CORR
2011
Springer
13 years 22 days ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
AGILE
2007
Springer
13 years 12 months ago
2007
Springer
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
STOC
1996
ACM
13 years 10 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...