2661 search results - page 273 / 533 » Quantum Complexity Classes |
124
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
131
Voted
COCO
2007
Springer
15 years 10 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
160
click to vote
CSR
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
135
click to vote
ICWE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. To build high-quality personalized Web applications developers have to deal with a number of complex problems. We look at the growing class of personalized Web Applicatio...
114
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
A framework for analyzing the computational capabilities and the limitations of the evolutionary process of random change guided by selection was recently introduced by Valiant [V...