Using Nondeterminism to Design Efficient Deterministic Algorithms
- 26 November 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 120-131
- https://doi.org/10.1007/3-540-45294-x_11
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Parameterized ComplexityPublished by Springer Nature ,1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973