Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
Explore this paper's citation graph
- Published
- 1979-01-01
- Cited by
- 2,094
- References
- 0
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59796624
References
No references recorded for this paper.
Cited by
- On the Solutions of NP-Complete Problems by Means of jNEP Run on Computers
- A Space-Efficient Algorithm for Paging Unbalanced Binary Trees
- Asymmetric Boltzmann machines
- A comparison of distributed test generation techniques
- Satisfiability and self-duality of monotone boolean functions
- Comparison of Clique-Listing Algorithms
- Scalability in Real-Time Systems
- Théorie algébrique des langages formels temps réel
- An O(n) bin-packing algorithm for uniformly distributed data
- On the polytope of fuzzy measures
- A Probabilistic Analysis of Propositional STRIPS Planning
- Analysis of STAGE Algorithm Based on Solving Bin Packing Problem
- ADAPTATION OF THE PROBABILITY CHANGING METHOD FOR WEBER PROBLEM WITH AN ARBITRARY METRIC
- Étude du problème de job shop avec un convoyeur
- Multi-level Grouping Genetic Algorithm for Low Carbon Virtual Private Clouds
- Graph theoretic facility layout design and evaluation : theoretical and practical considerations : a thesis presented in partial fulfilment of the requirements for the degree of Ph.D. in Operations Research at Massey University
- On Complexity of the Word Problem for Finitely Presented Commutative Semigroups
- RECENT RESULTS ON STABILITY ANALYSIS OF AN OPTIMAL ASSEMBLY LINE BALANCE
- Simple Algorithms for Graph Partition Problems
- Simulation ranking and selection procedures and applications in network reliability design
Related papers
No related papers recorded.