Parameterized Computational Feasibility
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Parameterized learning complexityPublished by Association for Computing Machinery (ACM) ,1993
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI DesignSIAM Journal on Discrete Mathematics, 1992
- Two strikes against perfect phylogenyLecture Notes in Computer Science, 1992
- An implementation for a fast public-key cryptosystemJournal of Cryptology, 1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- On the Complexity of Covering Vertices by Faces in a Planar GraphSIAM Journal on Computing, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- Exact and Approximate Solutions for the Gate Matrix Layout ProblemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987