6274 search results - page 543 / 1255 » From query complexity to computational complexity |
201
Voted
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...
199
Voted
CODES
2007
IEEE
16 years 1 months ago
2007
IEEE
Performance analysis of microprocessors is a critical step in defining the microarchitecture, prior to register-transfer-level (RTL) design. In complex chip multiprocessor systems...
210
click to vote
ICALP
2007
Springer
16 years 1 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...
253
Voted
TCC
2007
Springer
16 years 1 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
165
click to vote
PODC
2003
ACM
16 years 10 days ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...