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 theory
Search options answers only
not deleted
user 7422
Theoretical question deal with topics that do not generally have immediate practical uses. Please be careful when using this tag: your question may be more appropriate for the Computer Science Stack Exchange site.
3
votes
Preparing for TaoCP
It's not a work that you read through so much as a last-resort repository of ultimate answers. When you really need to know something about a certain data structure or algorithm, turn to the relevant …
- 110k
2
votes
Left and Right most Derivation
On their own, both left-most and right-most derivations are nothing but arbitrary rules that disambiguate which steps to take when parsing or generating with a CFG: many different orders of nontermina …
- 110k
1
vote
Significance of NFA in Compiler Design
Realizing an NFA in practice means backtracking, since your program flow cannot be in multiple different states simultaneously. (There are parallel processors, of course, but it's hard to map the irre …
- 110k
1
vote
Exposition of Data Representation
How? Well, by making it public and writable.
The data representation in this case is an int value for each Date component, but you'll notice that this isn't actually a particularly fitting choice - …
- 110k
6
votes
What defines the dimensionality of an array?
1: [0]
2: [0,0]
3: [0,0,0]
4: [0,0,0,0]
...
I think you've got it wrong. If you mean that these are one-/two-/three-/four-dimensional arrays, that's not the case: they're all one-dimensional, they …
- 110k
1
vote
Hashing + security as it pertains to a theoretical file sharing site
Sure, if you suspect that a certain illicit file is on the server you can upload another copy and deduce that it is there. But deducing isn't proof in a court of law; you'd still have to get the repo …
- 110k
119
votes
Accepted
How can lossless compression ever exist?
There can be no algorithm that losslessly compresses all inputs. But there are many algorithms that losslessly compress many inputs. And it turns out that most of the strings we like to operate on hav …
- 110k
13
votes
performance versus reusability
You should do whatever yields the greater business value in this situation.
Writing software is always a trade-off. Almost never are all valid goals (maintainability, performance, clarity, concisenes …
- 110k
91
votes
Accepted
Is a memory of all possible permutations of a kilobyte block and pointers possible?
There are 28192 possible different 1K blocks. Storing them all would take 28202 bits of storage. Since the universe contains only about 1080 (or ~2266) particles, it's a safe bet that it isn't possibl …
- 110k
1
vote
Accepted
NP-complete problem (subset sum) featured in Netflix series "Suits" S1 E8?
NP-complete problems are only unsolvable in the limit. As you state, exponential effort is entirely achievable if the basis is not too large. The question how large it can get depends on the state of …
- 110k