The Complexity of Combinatorial Computations: An Introduction
- 1 January 1978
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The expected linearity of a simple equivalence algorithmTheoretical Computer Science, 1978
- Mathematics and Computer Science: Coping with FinitenessScience, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- Efficient Planarity TestingJournal of the ACM, 1974
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847