2661 search results - page 193 / 533 » Quantum Complexity Classes |
138
click to vote
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
95
Voted
IPL
2008
15 years 3 months ago
2008
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
134
Voted
MST
2008
15 years 3 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
131
Voted
SIAMCOMP
2008
15 years 3 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
107
Voted
ORDER
2010
15 years 2 months ago
2010
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...