Tag: circuit-families

Found 15 results for 'circuit-families'.

---

1) lower-bounds - Circuit lower bounds over arbitrary sets of gates
2) cc.complexity-theory - Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?
3) cc.complexity-theory - Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?
4) boolean-functions - May Boolean circuits be exponentially more concise than Boolean formulae?
5) cc.complexity-theory - Complexity of advice language?
6) cc.complexity-theory - Why are mod_m gates interesting?
7) circuit-families - Classifying reversible gates
8) cc.complexity-theory - Circuits with oracles vs. Turing Machines with oracles
9) quantum-computing - Is there a finite unitary gate set which can exactly realise all QFTs of order $2^n$?
10) cc.complexity-theory - Other types of uniformity for circuits (incl. by small modifications)
11) circuit-complexity - OR-weft Hierarchy
12) cc.complexity-theory - Simulating Turing machines (output included) with circuits
13) cc.complexity-theory - Small circuits for circuit evaluation problem
14) cc.complexity-theory - Nonuniform circuit families - don't have to specify for arbitrarily large, but finite, input lengths?
15) cc.complexity-theory - $\mathrm{AC}^0$ upper bound for Hamming weight

---