2661 search results - page 120 / 533 » Quantum Complexity Classes |
134
click to vote
LATA
2012
Springer
13 years 10 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
126
click to vote
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Parallel processors such as SIMD computers have been successfully used in various areas of high performance image and data processing. Due to their characteristics of highly regula...
120
click to vote
ASAP
2008
IEEE
15 years 9 months ago
2008
IEEE
We address the problem of data parallel processing for computational quantum chemistry (CQC). CQC is a computationally demanding tool to study the electronic structure of molecule...
116
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
150
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...