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 uniformity
Search options answers only
not deleted
user 186
4
votes
The Examiner's Problem (uniform generation of SAT decision instances/answers)
It seems to me that you tried to get around this issue by imposing uniformity. …
- 21.8k
6
votes
Accepted
Proof Complexity and Circuit Lower bound for coNP
For the first question, it depends on what you mean by "harder". If you mean one logically implies the other then yes.
A lowerbound in a deterministic model of computation (containing negation) works …
- 21.8k