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 space-bounded
Search options answers only
not deleted
user 1800
Questions about space resources of computations in computational complexity or algorithms.
18
votes
Does LOGLOG = NLOGLOG?
The entry in the complexity zoo is surprisingly detailed; it claims that
NLOGLOG = co-NLOGLOG in the paper
Nondeterministic computations in sublogarithmic space and space constructibility, Vilia …
- 7,668
7
votes
Average-case space complexity
I'm interested in but not familiar with this topic. Searching for "Average case complexity theory", I found a thesis written by Tomoyuki Yamakami:
Average Case Computational Complexity Theory, Tom …
- 7,668
15
votes
Accepted
Logspace algorithms on graphs with bounded tree width
Tutte polynomial is an example.
This is a generalization of the chromatic polynomial, which itself is a #P-hard problem in any reasonable formulation. In
Evaluating the Tutte Polynomial for Gra …
- 7,668