1007 search results - page 30 / 202 » The Complexity of Futile Questioning |
LATIN
1998
Springer
14 years 1 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
AIPS
2006
13 years 11 months ago
2006
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks for classical propositional planning by a number of novel and interesting planning domains....
FLAIRS
2006
13 years 11 months ago
2006
For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
JSYML
2007
13 years 9 months ago
2007
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...