The parameterized complexity of maximality and minimality problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4169 LNCS, Issue , 2006, Pages 25-37

  Chen, Yijia ^a   Flum, Jörg ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; NUMBER THEORY; PROBLEM SOLVING;

NATURAL NUMBERS; PARAMETERIZED COMPLEXITY; SET INCLUSION;

SET THEORY;

EID: 33750246668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_3     Document Type: Conference Paper

References (14)

1. V. Arvind and V. Raman. Approximation algorithms for some parameterized counting problems. In P. Bose and P. Morin, editors, Algorithms and Computation, 13th International Symposium, ISAAC 2002, volume 2518 of Lecture Notes in Computer Science, 453-464, Springer, 2002.
2. C.C. Chang and H. J. Keisler. Model Theory, Studies in Logic and Mathematical Foundations, Volume 73. Amsterdam, the Netherlands, North-Holland, 1990.
3. Y. Chen, J. Flum, and M. Grohe. Bounded nondeterminism and alternation in parameterized complexity theory. In Proceedings of the 18rd IEEE Conference on Computational Complexity CCC '03, 13-29, 2003.
4. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
5. R.G. Downey, M.R. Fellows, and K. Regan. Descriptive complexity and the W -hierarchy. In Proof Complexity and Feasible Arithmetic, AMS-DIMACS Volume 39 Series, 119-134. 1998.
6. T. Eiter and G. Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6): 1278-1304, 1995.
7. H. Fernau. Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Tübingen, Germany, 2005.
8. J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113-145, 2001.
9. J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM Journal on Computing, 33(4):892-922 2005.
10. J. Flum and M. Grohe. Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science, 1(1), 2004.
11. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006.
12. 2n nondeterministic bits. Journal of Computer and System Sciences, 72: 34-71, 2006.
13. S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science, 289(2): 997-1008, 2002.
14. C. Ritter. Fagin-Defmierbarkeit. Diplomarbeit, Universität Freiburg, 2005.