1677 search results - page 40 / 336 » On the Completeness of Quantum Computation Models |
108
click to vote
STACS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Under CPA and CCA1 attacks, a secure bit encryption scheme can be applied bit-by-bit to construct a secure many-bit encryption scheme. The same construction fails, howe...
102
click to vote
CSR
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
111
click to vote
JSYML
2010
14 years 12 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
137
click to vote
ACCV
2010
Springer
14 years 8 months ago
2010
Springer
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...