Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with np
Search options not deleted
user 1612
In computational complexity, NP is the complexity class consisting of problems whose yes instances can be verified in polynomial time. NP stands for 'nondeterministic polynomial time '.
5
votes
1
answer
2k
views
BPP being equal to #P under Oracle
Luca Trevisan here gives a randomized polynomial-time approximation algorithm for #3-coloring given an NP oracle.
In a similar vein, I was wondering if there were any results on $BPP^{NP}\stackrel{?} … If there are no such results, then is $BPP^{NP}$ generally believed to be equal to #P? …
- 601
2
votes
Minimal Backtracking Proof Tree
I found a reference which proves that minimum propositional proof length is NP-hard to linearly approximate for a variety of systems from resolution proofs to Frege proofs. … Minimal Propositional Proof Length is NP-hard to Linearly Approximate …
- 601
5
votes
1
answer
539
views
Minimal Backtracking Proof Tree
When trying to prove that a particular instance of a problem like graph coloring or SAT is unsatisfiable, generally one explores the search tree using an algorithm like DPLL and the proof of unsatisfi …
- 601