Pages that link to "Item:Q4016401"

The following pages link to Circuit Definitions of Nondeterministic Complexity Classes (Q4016401):

Displaying 19 items.

• Positive and negative proofs for circuits and branching programs (Q896677) (← links)
• Properties that characterize LOGCFL (Q1176109) (← links)
• Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
• A lower bound for monotone arithmetic circuits computing \(0-1\) permanent (Q1276316) (← links)
• The computational complexity of the Lorentz lattice gas (Q1284985) (← links)
• Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
• On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
• The computational complexity of generating random fractals (Q1946896) (← links)
• Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
• Skew circuits of small width (Q2173307) (← links)
• Succinct certification of monotone circuits (Q2232601) (← links)
• A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
• Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
• Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
• Algebraic Complexity Classes (Q2821695) (← links)
• Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
• Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
• (Q3817611) (← links)
• Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits (Q6567780) (← links)