Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Mathematics
Linear and Abstract Algebra
Minimum degree of polynomial time NP complete problem algorithm
Reply to thread
Message
[QUOTE="Sandor, post: 3074993, member: 215408"] So no one is quite sure that P != NP, although they tend to favor that relation. But I was curious, has anyone proved a minimum degree order to any algorithm that solves NP complete problems in polynomial time? In other words, they don't know if it can be done in polynomial time, but do they know that it cannot be done in, say, quadratic time, and requires at least cubic time, or in cubic time and requires at least quartic time, or maybe they know that it is at least of order n^6? Maybe something kookier like n^3*(ln(n))^3? [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
Linear and Abstract Algebra
Minimum degree of polynomial time NP complete problem algorithm
Back
Top