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 reductions
Search options not deleted
user 143771
In computability and complexity, finding mappings between problems that allow solving one problem using a solution of another one. For reduction in programming language theory (e.g. beta-reduction), see [lambda-calculus] or [term-rewriting].
2
votes
Accepted
Help in proving L-Completeness
Can't make a comment so have to use an answer. It's a well-known fact that every non-trivial language in $L$ is complete under log-space reduction because the reduction could be used to decide the lan …
- 71
0
votes
Is a language semi-decidable iff it is reducible to ATM?
The proof contains two main statements:
prove that $RE$ (the set of all semi-decidable languages) is closed under $\le_{m}$ reduction (many-one reduction). It means that if we have a reduction $L_{1} …
- 71