Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,271,135 papers from all fields of science
Search
Sign In
Create Free Account
Computers and Intractability: A Guide to the Theory of NP-Completeness
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
AKS primality test
Chordal completion
Computational complexity theory
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Computers And Intractability A Guide To The Theory Of Np Completeness
T. Neumann
2016
Corpus ID: 124580286
Thank you very much for reading computers and intractability a guide to the theory of np completeness. As you may know, people…
Expand
Highly Cited
2006
Highly Cited
2006
Hard and soft constraints for reasoning about qualitative conditional preferences
Carmel Domshlak
,
S. Prestwich
,
F. Rossi
,
K. Venable
,
T. Walsh
J. Heuristics
2006
Corpus ID: 3238708
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional…
Expand
2003
2003
On the symmetry reduction method for Petri nets and similar formalisms
Tommi A. Junttila
2003
Corpus ID: 117621455
The symmetry reduction method is a technique for alleviating the combinatorial explosion problem arising in the state space…
Expand
Highly Cited
2001
Highly Cited
2001
Efficient computation of delay-sensitive routes from one source to all destinations
Ashish Goel
,
K. G. Ramakrishnan
,
D. Kataria
,
D. Logothetis
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 42734
In this paper we describe an efficient algorithm for the constrained shortest path problem which is defined as follows. Given a…
Expand
1996
1996
Incremental Methods for Formal Verification and Logic Synthesis
G. Swamy
1996
Corpus ID: 60739475
IC design is an iterative process; the initial specification of a design is rarely complete and correct. The designer begins with…
Expand
1995
1995
A Set Covering Approach to Infeasibility Analysis of Linear Programming Problems and Related Issues By
Richard LundgrenBurt SimonDate
1995
Corpus ID: 18736897
With the increased sophistication of both computers and optimization software, linear programming problems of a size…
Expand
1995
1995
Technology mapping of lookup table based field programmable gate arrays
Yuzheng Ding
1995
Corpus ID: 59631134
The Field Programmable Gate Array (FPGA) is a very attractive technology for application specific integrated circuit designs due…
Expand
1995
1995
The Minimum Broadcast Time Problem for Several Processor Networks
K. Jansen
,
H. Müller
Theoretical Computer Science
1995
Corpus ID: 26351688
1994
1994
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
Steven Minton
,
Ian Underwood
AAAI Conference on Artificial Intelligence
1994
Corpus ID: 14485126
We describe a method for learning formulas in first-order logic using a brute-force, smallest-first search. The method is…
Expand
Review
1980
Review
1980
Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness
R. V. Book
1980
Corpus ID: 118678141
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE