1199 search results - page 57 / 240 » Parameterized Proof Complexity |
IPL
2007
13 years 8 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...
CAISE
2006
Springer
14 years 14 days 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...
AIPS
2004
13 years 10 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 ...
EUROGP
2001
Springer
14 years 1 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...
APPROX
2009
Springer
14 years 3 months 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...