NP-complete - Wikipedia, the free encyclopedia
In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC , with NP standing for nondeterministic polynomial time), is a class of problems having two proper...
en.wikipedia.org/wiki/NP-complete
NP-complete problems which are of interest to the practical computer scientist. Now it is time to fulfill this prophecy and demonstrate this. We shall examine some of the popular NP-complete problems from various computational areas.
www.cs.uky.edu/~lewis/cs-heuristic/text/class/more-np.h... www.cs.uky.edu/~lewis/cs-heuristic/text/class/more-np.html
An Annotated List of Selected NP-complete Problems ... In the list of NP-complete problems below, the form of a typical entry is as follows: ... Comments: This is the simplest avatar of a very large number of NP-complete processor scheduling problems and, unsurprisingly given its practical applications in...
www.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.... www.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html
List of NP-complete problems - Wikipedia, the free encyclopedia
Here are some of the more commonly known problems that are NP-complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP-complete problems). ...
en.wikipedia.org/wiki/List_of_NP-complete_problems
NP-complete problems; 8.1 Search problems; Over the past seven chapters we have developed algorithms for nding shortest paths and minimum spanning trees in graphs, matchings in bipartite graphs, maximum increasing sub-sequences, maximum ows in networks, and so on.
www.cs.berkeley.edu/~vazirani/algorithms/chap8.pdf
This is a preliminary version of the catalog of NP optimization problems. ... This is a continuously updated catalog of approximability results for NP optimization problems. The compendium is also a part of the book Complexity and Approximation. The compendium has not been updated for a while, so there might exist...
www.nada.kth.se/~viggo/problemlist/compendium.html www.nada.kth.se/~viggo/problemlist/compendium.html
It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted.
portal.acm.org/citation.cfm?id=803884
A discussion of the complexity of regular expression matching algorithms in Perl. ... This page used to say "Regex Matching is NP-Complete". That may not be correct. I've been meaning to fix it for years, but I never got around to it before. To show that regex matching is NP-complete, we need to show two things.
perl.plover.com/NPC/ perl.plover.com/NPC/
CiteSeerX - Document Details (Isaac Councill, Lee Giles): An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. ... An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability...
citeseer.ist.psu.edu/ohya02new.html
Garey and Johnson, A guide to NP complete problems, W. H. Freeman, 1979. ... Document Not in Databas ... Context Related Articles ; This paper is cited by the following papers: Querying in Highly Mobile Distributed Environments - Imielinski, Badrinath (1992) (47 citations) (Correct);
citeseer.ist.psu.edu/contextsummary/761867/0
Related Topics