Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
NP-complete problems
Description:
Decision problems in computational complexity that are in NP and are at least as hard as every problem in NP.
Related topics:
Complexity and Algorithms in Graphs (16%),
Metaheuristic Optimization Algorithms Research (11%),
DNA and Biological Computing (8%)
Wikidata ID:
wiki/Q215206
OpenAlex ID:
keywords/np-complete-problems
Combinatorial Optimization: Algorithms and Complexity.
1984
·
David S. Johnson
, Christos H. Papadimitriou
, et al.
·
American Mathematical Monthly
·
5,960
Ising formulations of many NP problems
2014
·
Andrew Lucas
·
Frontiers in Physics
·
2,960
PDF
Approximation algorithms for combinatorial problems
1974
·
David S. Johnson
·
Journal of Computer and System Sciences
·
2,211
PDF
The Complexity of Enumeration and Reliability Problems
1979
·
Leslie G. Valiant
·
ACM eBooks
·
2,133
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
2001
·
Edward Farhi
, Jeffrey Goldstone
, et al.
·
Science
·
2,100
PDF
Which Problems Have Strongly Exponential Complexity?
2001
·
Russell Impagliazzo
, Ramamohan Paturi
, et al.
·
Journal of Computer and System Sciences
·
1,545
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
1994
·
Shummet Baluja
·
1,290
A multilevel algorithm for partitioning graphs
1995
·
Bruce Hendrickson
, Robert Leland
·
ACM/IEEE Conference on Supercomputing (SC)
·
1,110
DNA Solution of Hard Computational Problems
1995
·
Richard J. Lipton
·
Science
·
1,046
Where the really hard problems are
1991
·
Peter Cheeseman
, Bob Kanefsky
, et al.
·
International Joint Conference on Artificial Intelligence
·
1,004
Approximation algorithms for NP-complete problems on planar graphs
1994
·
Brenda S. Baker
·
Journal of the ACM
·
987
PDF
Ensemble quantum computing by NMR spectroscopy
1997
·
David G. Cory
, Amr F. Fahmy
, et al.
·
Proceedings of the National Academy of Sciences
·
956
A General Approximation Technique for Constrained Forest Problems
1995
·
Michel X. Goemans
, David P. Williamson
·
SIAM Journal on Computing
·
884
Hiding information and signatures in trapdoor knapsacks
1978
·
R. Merkle
, M. Hellman
·
IEEE Transactions on Information Theory
·
842
The NP-completeness column: An ongoing guide
1986
·
David S Johnson
·
Journal of Algorithms
·
798
Determining computational complexity from characteristic ‘phase transitions’
1999
·
Rémi Monasson
, Riccardo Zecchina
, et al.
·
Nature
·
790
Exact Algorithms for NP-Hard Problems: A Survey
2003
·
Gerhard J. Woeginger
·
Lecture notes in computer science
·
702
NP is as easy as detecting unique solutions
1986
·
L.G. Valiant
, V.V. Vazirani
·
Theoretical Computer Science
·
678
Particle swarm optimization for task assignment problem
2002
·
Ayed Salman
, Imtiaz Ahmad
, et al.
·
Microprocessors and Microsystems
·
666
Upper bounds to the clique width of graphs
2000
·
Bruno Courcelle
, Stephan Olariu
·
Discrete Applied Mathematics
·
659
PDF
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
2002
·
Ravinderjit S. Braich
, Nickolas Chelyapov
, et al.
·
Science
·
570
Cliques, Coloring, and Satisfiability
1996
·
Johnson, David
, Trick, Michael
·
DIMACS series in discrete mathematics and theoretical computer science
·
550
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
2006
·
Beatrice Ombuki
, Brian J. Ross
, et al.
·
Applied Intelligence
·
536
DNA computing on surfaces
2000
·
Qinghua Liu
, Liman Wang
, et al.
·
Nature
·
528
Membrane Computing: 10th International Workshop, WMC 2009, Curtea de Arges, Romania, August 24-27, 2009. Revised Selected and Invited Papers
2010
·
Rius Font, Miquel
, Gutiérrez Escudero, Rosa
, et al.
·
Lecture notes in computer science
·
455
Show more works
View as search
Works count:
7,546
Citation count:
116,600
Year
Topic
Type