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 9535
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.
0
votes
Efficiently getting bits of N! ?
I believe the problem is thought to be hard, but I unfortunately have no reference to give.
A "complexity class" upper bound in given by Peter Bürgisser
in the paper On defining integers and proving …
1
vote
Is there any space(n) complete language?
A canonical complete language for $LINSPACE = DSPACE(n)$ would be the following language
$L =\{ < M,x,1^s>\ :\ M\ \text{is a Turing machine that accepts}\ x\ \text{using space}\ s\}$
which is comple …