7 search results - page 2 / 2 » Paraconsistent Machines and their Relation to Quantum Comput... |
JCSS
2008
13 years 4 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...