Sciweavers

341 search results - page 32 / 69
» Quantum Computation and Lattice Problems
Sort
View
DBWORKSHOPS
1992
13 years 9 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 8 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 5 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
KES
2005
Springer
14 years 1 months ago
Uncertainty Management in Logic Programming: Simple and Effective Top-Down Query Answering
We present a simple, yet general top-down query answering procedure for logic programs managing uncertainty. The main features are: (i) the certainty values are taken from a certai...
Umberto Straccia
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson