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-complexity
Search options not deleted
user 171443
Asymptotic analyses of the space needed to run algorithms.
0
votes
1
answer
40
views
need to prove that $DSPACE(O(2^n)) \neq EXP$
this question is from my computational complexity HW.
I'm not sure if my solution is correct:
If $DSPACE(O(2^n)) = EXP$, than we can take language $ L \in DTIME(2^{2^n})$ which not in $EXP$ (from the …
0
votes
Accepted
need to prove that $DSPACE(O(2^n)) \neq EXP$
I agree that such an $L$ exists by THT and that $L_{pad}\in \text{DTIME}(2^n),$ but from there I'm not really grasping your argument. Where is $L_{pad}\in \text{DSPACE}(O(2^n))$ (or anything about spa …