np-complete


Can it be proven no polynomial algorithm exists for an NP-Complete prob.?


I can't really seem to grasp what it really means to say a problem is NP-Complete. Could anyone help me with the following question?
An NP-complete problem is a problem for which one can prove that an algorithm for solving it in polynomial time does not exist. Is the statement true?
I would want to say this statement isn't true, because can anyone actually prove that such an algorithm doesn't exist for any NP-Complete problem? From looking around on various sources, I understand that no polynomial time algorithm is known for any NP-Complete problem; however, it can't be proven.
Any help would be greatly appreciated. Thanks.
It is possible in some situations to prove that no algorithm exists that is better than a certain limit.
For example the O(n log n) bound for a comparison sort has been proven. No matter how clever we become in the future, we can be sure that no-one will ever invent an O(n) comparison sort.
In this case though, no-one has found a proof. But that doesn't mean it can't be proven.
The statement is more fundamentally wrong: There are problems that cannot be solved in polynomial time which are much harder than NP problems. The point of NP completeness is a polynomial time solution existing is equivalent to P=NP (which means additionally that a solution not existing means P!=NP).

Related Links

NP-complete or NP-hard?
Why using linear integer programming (ILP) though it is NP-Complete?
Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
Reduction to Clique prob
Approximation Algorithm between two NP compete problems
Is it possible to find the probability to a solution of NP-complete problems?
Knapsack for each weight having multiple values - Is it possible to solve?
Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete
How I can prove that 2-CNF is not NP-complete?
When NP complete becomes NP hard
Can it be proven no polynomial algorithm exists for an NP-Complete prob.?
Effect of number base when proving NP completeness of numerical problems
How to reduce 3COLOR to 3SAT?
proof NP-complete
Proof that Dominating Set is NP-Complete
Is this an NP problem?

Categories

HOME
log4j
clips
activiti
pycharm
kde
objectgears
read-eval-print-loop
rsyslog
filtering
c#-2.0
icloud
qore
awesome-wm
volttron
postgres-xl
decomposition
worldwind
foselasticabundle
scriptcs
abi
css-animations
captiveportal
centos6.5
dynamic-featured-image
kendo-datasource
quote
delicious-api
bluestacks
google-rich-snippets
bosh
google-qpx-express-api
stringtemplate
azure-sql-database
google-api-nodejs-client
environment-modules
html5-fullscreen
multilingual
espeak
libvpx
az-application-insights
ssjs
firebase-admin
mime
.net-4.6.2
scorm
rainbowtable
appcompat
veracode
mu
iso8601
messenger
color-picker
spring-android
libpng
dstu2-fhir
file-writing
autorest
lttng
skype4py
asp.net5
hsv
ora-00900
qdialog
purge
deis
appfabric-cache
ami
proj4js
kineticjs
website-monitoring
dd
rdtsc
issuu
concurrent-collections
mcts
access-rights
jmapviewer
web2py-modules
bulkloader
jquery-mobile-dialog
drools-planner
pysimplesoap
jspinclude
ohm
netdna-api
libc++
stage
hirefire
psi
cinema-4d
lang
sudzc
subviews
perfect-hash
firefox-5
compiler-specific
port-number
mdac

Resources

Encrypt Message