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 circuits
Search options not deleted
user 114052
A computation model in which the computation is described via circuits of various logic gates.
4
votes
0
answers
42
views
"Small" formulas for boolean functions
Theorem 10 in the following document:
https://sites.math.rutgers.edu/~sk1233/courses/topics-S13/lec1.pdf
states that every boolean function $f:\{0, 1\}^n\rightarrow \{0, 1\}$ has formula complexity $O …
- 141