8196 search results - page 350 / 1640 » Computational Modeling and Complexity Science |
181
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
299
click to vote
Book
"This book is mainly about the development of our ideas on how the brain
handles visual information; it covers roughly the period between 1950 and
1980. Intuition tells us t...
157
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
145
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
171
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...