2661 search results - page 289 / 533 » Quantum Complexity Classes |
146
click to vote
MST
2010
15 years 2 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
254
click to vote
PODS
2009
ACM
16 years 4 months ago
2009
ACM
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
152
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
139
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We study Reader-Writer Exclusion [1], a well-known variant of the Mutual Exclusion problem [2] where processes are divided into two classes–readers and writers–and multiple re...
155
click to vote
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...