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?
113 Views Asked by Cleverson 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
- 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?
Related Questions in RESTRICTIONS
- How to sync 2 folders on 2 remote computers via Email?
- xsd2code++ restrictions not generated
- Django forms DateTimeInput widget- how to specify max date?
- What restrictions does Android put in place on activities viewed on top of a secure keyguard with FLAG_SHOW_WHEN_LOCKED?
- nginx and php5-fpm open_basedir restriction in effect am I under attack?
- Add restriction to a Knapsack algorithm in php
- Is there any way to find out what's blocking my app's internet access?
- Hibernate comparing value(or parts of) to 2 columns
- overriding minOccurs from a group
- How to validate XML elements with XSD schema?
- Restraining mobile number input
- Retrieve OWL class restrictions using OWL API
- Is there a limit to the size of database I can use in an Android OS app?
- Hibernate criteria: search by content on a property list in an entity
- Test In-Memory collection against NHibernate restrictions
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?
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!