Tag: circuit-complexity


Found 149 results for 'circuit-complexity'.


1) graph-theory - How many disjoint edge-cuts a DAG must have?
2) circuit-complexity - What are bounded-treewidth circuits good for?
3) pl.programming-languages - Program Minimization
4) cc.complexity-theory - How expensive may it be to destroy all long s-t paths in a DAG?
5) cc.complexity-theory - Most efficient way to convert an $\text{AC}^0$ circuit to a circuit (of any depth) with gate fanout 1
6) circuit-complexity - Arithmetic circuits with just one threshold gate
7) cc.complexity-theory - How powerful are nondeterministic constant-depth circuits?
8) cc.complexity-theory - Are there any parameterized problems in non-uniform FPT that are suspected (but not proven) to be in uniform-FPT?
9) cc.complexity-theory - Fourier coefficients Boolean Functions described by Bounded Depth Circuits with AND OR and XOR gates
10) cc.complexity-theory - Proof Complexity and Circuit Lower bound for coNP
11) circuit-complexity - Circuit complexity of group actions
12) cc.complexity-theory - A Notion of Monotone Quantum Circuits
13) cc.complexity-theory - Circuit lower bounds and kolmogorov complexity
14) cc.complexity-theory - What are the consequences of $P \subseteq L/poly$?
15) cc.complexity-theory - Lower bounds for constant-depth formulae?
16) cc.complexity-theory - Formula size lower bounds for AC0 functions
17) cc.complexity-theory - A fixed-depth characterization of $TC^0$? $NC^1$?
18) cc.complexity-theory - PARITY $\notin$ $AC^0$ with bounded fanout: easy proof?
19) lower-bounds - Circuit lower bounds over arbitrary sets of gates
20) cc.complexity-theory - Can reciprocal inputs speed up monotone computations?
21) cc.complexity-theory - Monotone arithmetic circuits
22) cc.complexity-theory - Are arithmetic circuits weaker than boolean?
23) cc.complexity-theory - On Defining Probabilistic/Nondeterministic Circuits
24) circuit-complexity - Circuit and Formula Lower Bounds for Separating Sparse Sets of Strings
25) cc.complexity-theory - Oracular separations between poly- and log-depth quantum circuits
26) ds.algorithms - Evaluate boolean circuit on batch of similar inputs
27) cr.crypto-security - Simple candidates for pseudorandom permutations?
28) quantum-computing - Quantum oracle implementation overhead
29) cc.complexity-theory - What is the minimum required depth of reductions for NP-hardness of SAT?
30) cc.complexity-theory - Is BPP vs. P a real problem after we know BPP lies in P/poly?
31) cc.complexity-theory - Example demonstrating the power of non-deterministic circuits
32) cc.complexity-theory - Idea for a white-box PIT deterministic algorithm in polynomial time
33) quantum-computing - Is unbounded quantum fanout operation experimentally feasible?
34) cc.complexity-theory - Why lower bounds for boolean Circuits does not imply arithmetic circuits lower bounds
35) cc.complexity-theory - $\mathsf{NC^1}$ circuit evaluation
36) circuit-complexity - $AC^0$[subexp] vs. NC
37) co.combinatorics - VC dimension of polynomials over tropical semirings?
38) circuit-complexity - Complexity of multi-linear polynomial computing Boolean function
39) circuit-complexity - Arithmetic complexity of matrix powering
40) cc.complexity-theory - Is SAT a context-free language?
41) reference-request - Reference for Dyck languages being $\mathsf{TC}_0$-complete
42) cc.complexity-theory - Does L have a definition in terms of circuits?
43) cc.complexity-theory - Shortest formula for an n-term monotone CNF
44) ds.algorithms - OR-circuit complexity of a dense linear operator
45) lo.logic - logic in the presence of doubt, uncertainty, lies
46) cc.complexity-theory - (0,1)-vector XOR problem
47) cc.complexity-theory - Complexity of finding even cuts for a graph
48) cc.complexity-theory - References on Circuit Lower Bounds
49) cc.complexity-theory - Razborov's Approximation methods
50) circuit-complexity - How small can be a layered boolean circuit for a function with circuit complexity $s$?