Pages that link to "Item:Q4267800"
From MaRDI portal
The following pages link to The permanent requires large uniform threshold circuits (Q4267800):
Displaying 18 items.
- Dependence logic with a majority quantifier (Q302214) (← links)
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- Root finding with threshold circuits (Q690451) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- A Uniform Circuit Lower Bound for the Permanent (Q4312420) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)
