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 computational-complexity
Search options not deleted
user 7092
This is a branch that includes: computational complexity theory; complexity classes, NP-completeness and other completeness concepts; oracle analogues of complexity classes; complexity-theoretic computational models; regular languages; context-free languages; Komolgorov Complexity and so on.
1
vote
Completeness, easiest, hardest problems
It sounds like what you're talking about is the very basics of recursion theory, particularly the Turing degrees and even more specifically the degree 0' that contains the complete set K (defined as t …
- 1,951
3
votes
1
answer
1k
views
Is there a promise version of 3-coloring equivalent to Graph Isomorphism?
The discussion at Decision problem restricted to inputs that satisfy some necessary condition. got me thinking about specific promises on a graph that would reduce the complexity of the coloring probl …
- 1,951
4
votes
Counting $\mathrm{mod}\:p$ solutions of Diophantine equation in two variables taking $O(p^2)...
At least for fixed degree, the answer appears to be 'no' — it seems to be well-established that the number of roots of a univariate polynomial $g(x)$ of degree $d$ modulo a prime $p$ can be determined …
- 1,951
10
votes
Undecidable infinite analogs of NP-complete problems?
There's at least one notable counter-example: solving the mate-in-$poly(n)$ problem for chess on an $n\times n$ board is PSPACE-complete and thus NP-hard (per https://arxiv.org/abs/2010.09271 ), but t …
1
vote
Indexing schemes of binary sequences
You want Volume 4, Fascicle 3 of Knuth's The Art of Computer Programming, chapter 7.2.1.3: "Generating All Combinations" - I won't include links because everyone has a favorite online bookseller, but …
- 1,951