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 circuit-complexity
Search options not deleted
user 686
Circuit complexity is the study of resource-bounded circuits and the functions computed by such circuits.
7
votes
1
answer
361
views
Non-uniform hierarchy theorem for approximating functions
It is easy to show (by probabilistic argument) that there exist functions that require circuits of size $O(2^n/n)$. This, in turn, can be used to prove a non-deterministic hierarchy theorem showing (r …
- 1,242
6
votes
Threshold Fully Homomorphic Cryptosystems
A new paper by Steven Myers, Mona Sergi, and Abhi Shelat on eprint, "Threshold Fully Homomorphic Encryption and Secure Computation", claims a threshold fully homomorphic encryption scheme.
From their …
- 1,242
11
votes
2
answers
417
views
Variants of direct product theorems
A direct product theorem, informally, says that computing $k$ instances of a function $f$ is harder than computing $f$ once.
Typical direct product theorems (e.g., Yao's XOR Lemma) look at average-ca …
- 1,242