Sciweavers

2233 search results - page 6 / 447
» On the Complexity of Theory Curbing
Sort
View
MST
2011
237views Hardware» more  MST 2011»
13 years 2 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
DEBS
2011
ACM
12 years 10 months ago
DejaVu: a complex event processing system for pattern matching over live and historical data streams
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
Nihal Dindar, Peter M. Fischer, Nesime Tatbul
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
The physical Church-Turing thesis and the principles of quantum theory
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
Pablo Arrighi, Gilles Dowek
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 6 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...