P-uniform circuit complexity
From MaRDI portal
Recommendations
- Some results on uniform arithmetic circuit complexity
- On uniformity and circuit lower bounds
- scientific article; zbMATH DE number 1161568
- Uniform Proof Complexity
- Lower bounds against weakly uniform circuits
- A note on the circuit complexity of PP
- On the complexity of circuit satisfiability
- Uniform Circuits, & Boolean Proof Nets
- Proving Circuit Lower Bounds in High Uniform Classes
- Parity, circuits, and the polynomial-time hierarchy
Cited in
(19)- Deciding bisimilarity is P-complete
- Non-commutative arithmetic circuits: depth reduction and size lower bounds
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem
- The complexity of computing maximal word functions
- Expressing uniformity via oracles
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Polynomial games and determinacy
- On uniformity within \(NC^ 1\)
- Extensional Uniformity for Boolean Circuits
- Amplifying circuit lower bounds against polynomial time, with applications
- scientific article; zbMATH DE number 3960998 (Why is no real title available?)
- Some results on uniform arithmetic circuit complexity
- On uniformity and circuit lower bounds
- AND and/or OR: uniform polynomial-size circuits
- Mathematical Foundations of Computer Science 2004
- Subclasses of \textsc{Ptime} interpreted by programming languages
- Relations among parallel and sequential computation models
- Tradeoff lower lounds for stack machines
- Some classes of languages in \(NC^ 1\)
This page was built for publication: P-uniform circuit complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474881)
