If P != NP, are there then more Polynomial problems than SuperPolynomial problems, or vice versa?
If P != NP, are there more P than non-P problems or vice versa?
207 Views Asked by Albert Hendriks At
1
There are 1 best solutions below
Related Questions in COMPLEXITY-THEORY
- Sorting complexity
- Determinating Complexity time
- Probability mass of summing two discrete random variables, in linearithmic time
- A little help finding the complexity of time and and complexity of space
- Most efficient way to print differences of two arrays?
- Calculating the Recurrence Relation T(n)=T(n / log n) + Θ(1)
- How can I tell how many times these nested statements will execute?
- Complexity of this greedy algorithm to find the maximum independent set of a graph
- What is the complexity of this piece of code
- Ways to measure bit sequence complexity
- What is an Approximation Factor?
- Data structure request: Lazily infinite set
- What does it mean that a tree's height is O(lg n)?
- Two functions are not taking the time I would expect due to their big-O complexity, can anyone explain why?
- Booking System is NP Complete
Related Questions in NP-COMPLETE
- How to prove a prob is np complete and is in np?
- Heuristic to find the maximum weight independent set in an arbritary graph
- Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
- example of reduction a polynomial decision to an NP-complete
- Set Cover Reduction
- NP-Complete VS NP-Hard
- Is this a correct understanding of proving something is NP Complete?
- NP complete - solvable in non-deterministic polynomial time
- How to generate a partial board solution for N-Queens (P vs NP)?
- Is longest possibly non-simple path in NP?
- Is GAP (graph accessibility) NP-Complete?
- 3-OCC-MAX SAT np-complete?
- Np-hardness reduction
- Hamiltonian paths & social graph algorithm
- Complexity measurement of NP-complete
Related Questions in NP
- Confusion about why NP is contained in PSPACE, EXPTIME etc
- How to prove a prob is np complete and is in np?
- Efficiently assign games
- Study: NP-Completeness Using Hamiltonian Path
- Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
- ASP Clingo - splitting graph to n cliques
- Smallest sum of difference between elements in two lists
- Booking System is NP Complete
- Max 3 color algorithm
- Algorithmic Analysis - Are there any algorithms having their best case complexity of the order of n^99?
- Knapsack or similar with no values and with limits as to which items can be assigned where?
- L-complement in NP
- 3-colouring of a graph (polynomial time)?
- Concatenation of two languages in NP
- when a given graph is 3-colorable?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
From a formal languages perspective, there are only countably many problems in P and uncountably many problems not in P. Every problem in P can be solved by a deterministic, polynomial-time Turing machine, and since the number of TMs is countably infinite, the number of languages in P is countably infinite. On the other hand, the number of total languages is equal to the number of possible subsets of strings, so there are uncountably many languages not in P. This result is, interestingly enough, independent of whether P = NP.
If you restrict "problems" to "decidable problems" (that is, problems that are solvable by computers with unbounded time and storage space), then we know that there are only countably many total decidable problems. Countably infinitely many of them are in P and, regardless of whether P = NP, there are countably infinitely many of them not in P.
Hope this helps!