I have to answer this question as a homework assignment but I am finding very little material to work with. I understand what is a NP-complete problem and what is a restriction. In my opinion, this statement is true, because you can always restrict the problem in order to "make the problem easier". But I'm looking at it with a bird's eye view... Can anyone help me make some progress finding the answer to this question? Any help will be much appreciated.
Does every NP-complete prob. admit a polynomial-time restriction?
116 Views Asked by Cleverson At
1
There are 1 best solutions below
Related Questions in COMPLEXITY-THEORY
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What's the complexity of `+=` for a string in Python
- How to find big o of dependent loops and recursive functions?
- Understanding Unary PCP Reduction to a Matching Problem (UPCP)
- How to determine the time complexity of a recursive function that has a loop enclosed in it?
- Does the square root of an input lie in the middle of that input?
- Hash Table creation runtime complexity
- Optimization - Algorithm for finding load set combination that returns the maximum Von Mises stress
- Time complexity of a divide and conquer algorithm that searches for a value in an n x m table, rows and columns are sorted
- Big O notation of string permutation in Python
- finding the time complexity of the program
- how do i find the time complexity (big O) of this triple loop?
- determine the big o running time of the method
- Reduction from Hamiltonian path to Tripartite decision problem
- How to implement the Sosic and Gu linear algorithm for the n-queens problem
Related Questions in NP
- How do I implement the np.argmin function for several dimensions
- i installed numpy 1.26.3 but still not able to use np. method
- K-Hamiltonian Path problem and NP-completeness
- Computational Learning Problem: 3-DNF Reduction
- Editing a clique into a k-plex optimally is NP?
- NP hardness of bin packing with a fixed number of bins
- Example of 3CNF to Hitting set conversion
- Fast algorithm for n-rooks completion puzzle
- Deconstruct a column with dict values into multiple columns in pandas
- How to optimize this set-picking algorithm?
- np.where group multiple columns and pivot
- Getting error: "You must be logged in. Use `npm login` and try again." when trying to publish with NP
- np.load from relative file in the python package
- Searching Algorithm: Product Knapsack Problem with goal to find lowest product above a certain threshold?
- Authentic List of NP, NP Complete and NP Hard problems
Related Questions in RESTRICTIONS
- Conditions widget in protege 5
- How to slow down load time for a website
- How to get a device handle to pass to WriteFile within UWP C#
- WCF service: restrictions for WebGet and WebInvoke with AD - security roles for a website with anonymous access
- How to restrict app installation on devices which don't have 4K camera?
- Detect anonymous allocations in GNAT predefined libraries
- Bypass IP restriction SSH
- abstract controller connected to repository using restrictions - asp.net core 2
- Limit page creations by user role functions.php
- "SELECT *" except for columns the user is not allowed to view
- Protege: property domain restrictions using other properties
- Ionic App blocked by iOS 'Specific Website Only' restriction
- Append Criteria query to previous query in Hibernate
- Restrict php code to logged in users - Wordpress
- Set Multiple Restrictions for Rows Called to Print in Pandas
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 # Hahtags
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?
Converting my comment into an answer - consider the "empty problem," a problem whose instance set is empty. Since the empty set is a subset of every set, this problem technically counts as a restriction of any language (including languages not in NP). It's also a problem in P; you can build a polynomial-time TM that always rejects its input. Therefore, every problem in NP has a polynomial-time restriction.
What I'm still curious about, though, is whether every NP problem whose instance set is infinite has a polynomial-time restriction whose instance set is also infinite. That's a more interesting question, IMHO, and I don't currently have an answer.
Hope this helps!