Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Parameterized complexity for the skepticPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Bounded Fixed-Parameter Tractability and log2 n Nondeterministic BitsLecture Notes in Computer Science, 2004
- Parameterized complexity for the database theoristACM SIGMOD Record, 2002
- New results on monotone dualization and generating hypergraph transversalsPublished by Association for Computing Machinery (ACM) ,2002
- Fixed-Parameter Tractability, Definability, and Model-CheckingSIAM Journal on Computing, 2001
- Deciding the Vapnik–Červonenkis Dimension is∑p3-completeJournal of Computer and System Sciences, 1999
- Parameterized ComplexityPublished by Springer Nature ,1999
- On Limited Nondeterminism and the Complexity of the V-C DimensionJournal of Computer and System Sciences, 1996
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980