Guoqiang Pan Department of Computer Science Rice University ...  Home/Search
Context
Related
| rice.edu/~vardi/papers...lics062.pdf.gz From: rice.edu/~vardi/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Treewidth measures the "tree-likeness" of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this work, we study the impact of treewidth bounds on QBF, a canonical PSPACE-complete problem. This problem is known to be fixed-parameter tractable if both the treewidth and alternation depth are taken as parameters. We show here that the function bounding the complexity in the parameters is provably nonelementary (assuming P is ... (Update)
Active bibliography (related documents): More All
0.5: A Perspective on Lindström Quantifiers and Oracles - Stewart (Correct)
0.1: The Convenience of Tilings - Boas (1997) (Correct)
0.1: Program Verification with Monadic Second-Order Logic & Languages.. - Møller (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ department-fixedparameter,
author = "Guoqiang Pan Department",
title = "Fixed-Parameter Hierarchies inside PSPACE",
url = "citeseer.ist.psu.edu/766277.html" }
Citations (may not include all citations):143 algorithmic aspects of treewidth (context) - Robertson, Seymour et al. - 1986
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
139 Reasoning about infinite computations - Vardi, Wolper - 1994
32 tree structured constraint satisfaction problems (context) - Freuder, k-
29 Weak monadic second order theory of successor is not element.. (context) - Meyer - 1975
28 Constraint Processing (context) - Dechter - 2003
22 Parametrized Complexity (context) - Downey, Fellows - 1999
17 Domino-tiling games (context) - Chlebus - 1986
13 Complexity classifications of Boolean constraint satisfactio.. (context) - Creignou, Khanna et al. - 2001
12 Weak second-order arithmetic and finite automata (context) - uchi - 1960
12 Complexity of solvable cases of the decision problem for the.. (context) - Lewis - 1978
2 The polynomial hierarchy (context) - Stockmeyer - 1976
1 Treewidth in verification: Local vs (context) - Ferrara, Pan et al. - 2005
1 The complexity of first-order and monatic second-order logic.. (context) - Frick, Grohe - 2002
1 Quantified constraint satisfaction and bounded treewidth - Chen - 2004
1 uchi automana with applications to temporal logic (context) - Sistla, Vardi et al. - 1987
1 The complexity of decision problems in automate theory and l.. (context) - Stockmeyer - 1974
1 From pebble games to tractability: An ambidextrous consisten.. (context) - Chen, Dalmau - 2005
1 The complexity of quantified constraint satisfaction problem.. (context) - Gottlob, Greco et al. - 2005
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC