1199 search results - page 57 / 240 » Parameterized Proof Complexity |
145
click to vote
IPL
2007
15 years 5 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
133
click to vote
CAISE
2006
Springer
15 years 9 months ago
2006
Springer
We describe the formal models of two standards related to airport security: one at the international level and the other at the European level. These models are expressed using the...
154
click to vote
AIPS
2004
15 years 7 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
150
click to vote
EUROGP
2001
Springer
15 years 10 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
149
click to vote
APPROX
2009
Springer
16 years 17 days ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...