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 complexity-theory
Search options not deleted
user 139929
Questions related to the (computational) complexity of solving problems
2
votes
1
answer
58
views
Is "Length of Longest Increasing Subsequence" in L?
I can't find space complexity of this problem with search engines.
I think I have NL algorithm for it (just a basic "one by one non-deterministically accept values if possible"), but I wonder what oth …
- 255
1
vote
Is "Length of Longest Increasing Subsequence" in L?
closest I could find so far:
https://arxiv.org/abs/2002.08498 provides an SC algoritgm (polylog space, poly time) for approximation of LIS
savitch seems to give smallest space so far
- 255