2661 search results - page 220 / 533 » Quantum Complexity Classes |
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
146
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
98
Voted
COLT
2003
Springer
15 years 9 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
135
click to vote
ER
2009
Springer
15 years 8 months ago
2009
Springer
Ontological metamodeling or multilevel-modeling refers to ng complex domains at multiple levels of abstraction, especially in domains where the borderline between individuals and c...
121
click to vote
PODS
2000
ACM
15 years 8 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...