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
|
|
|
Many hundreds of NP-complete problems have been identified, including; SubsetSum (given a set of positive integers presented in decimal notation, and a target T, is there a subset summing to T?), many graph problems; ... There are interesting examples of NP problems not known to be either in P; or NP-complete.
|
www.claymath.org/millennium/P_vs_NP/Official_Problem_De...
www.claymath.org/millennium/P_vs_NP/Official_Problem_Description.pdf
|
|
|
|
CiteSeerX - Document Details (Isaac Councill, Lee Giles): A variant of P systems, recently introduced, considers membranes which can multiply by division. Two types of division are considered: division for elementary membranes (i.e. membranes not containing other membranes inside) and division for non-elementary membranes.
|
citeseer.ist.psu.edu/447882.html
citeseer.ist.psu.edu/447882.html
|
|
|
|
|
7 Summary Shor s factoring algorithm and Grover s search algorithm are the two quintessential algorithms of quantum computing. Their discoveries spurned on the development of QC by demonstrating .... Yu Shi. Quantum computation with Bose-Einstein condensation and capable of solving NP-complete and #p problems.
|
citeseer.ist.psu.edu/context/1902881/0
citeseer.ist.psu.edu/context/1902881/0
|
|
|
But what if P=NP, and the algorithm takes n10000 steps? God will not be so cruel. What could we do if we could solve NP-complete problems? ...
|
www.scottaaronson.com/talks/npcomplete.ppt
www.scottaaronson.com/talks/npcomplete.ppt
|
|
NP-complete Problems and Physical Reality; Scott Aaronson∗; Abstract; Can NP-complete problems be solved efficiently in the physical universe? ... 5This is one fact I seem to remember from my computer architecture course. 6On the other hand, if #P-complete problems were solvable in quantum polynomial time,
|
www.scottaaronson.com/papers/npcomplete.pdf
www.scottaaronson.com/papers/npcomplete.pdf
|
|
rdfs:label Solving NP-Complete Problems Using P Systems with Active Membranes. (xsd:string) ... swrc:pages 289-301 (xsd:string) ... Home | Example Publications...
|
dblp.l3s.de/d2r/resource/publications/conf/umc/ZandronF...
dblp.l3s.de/d2r/resource/publications/conf/umc/ZandronFM00
|
|
Microsoft Research picks up a theme on which I worked in the late seventies and early eighties: Transition points for NP-complete problems: points where easy problems suddenly become hard to solve, or vice versa. ... Viewgraphs on P-optimal algorithms are available: PowerPoint version, PostScript version. Note that a...
|
www.ccs.neu.edu/home/lieber/p-optimal/README.html
www.ccs.neu.edu/home/lieber/p-optimal/README.html
|
|
P systems are parallel Molecular Computing models based on processing multisets of objects in cell-like membrane structures. ... We prove that this variant is not only computationally universal, but also able to solve NP complete problems in polynomial (actually, linear) time. We exemplify this assertion with the well...
|
researchspace.auckland.ac.nz/handle/2292/3611
|
|
