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="fresh_42, post: 6217014, member: 572553"] It is generally harder to prove lower bounds, as one has to prove that something is impossible, rather than showing a smart algorithm. However, polynomial lower bounds are trivial. Every input character is needed in at least one calculation step, or otherwise is not necessary. This means we have at least ##O(n)## calculations. Depends on the problem. We have a trivial lower bound ##O(n)## and usually an exponential upper bound for NP problems, also trivial, as we simply can check all (exponentially many) possible answers. [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
Linear and Abstract Algebra
Minimum degree of polynomial time NP complete problem algorithm
Back
Top