Pages that link to "Item:Q4625658"
From MaRDI portal
The following pages link to Circuit Complexity, Proof Complexity, and Polynomial Identity Testing (Q4625658):
Displaying 10 items.
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Polynomial identity testing for depth 3 circuits (Q2472430) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Witnessing matrix identities and proof complexity (Q4634922) (← links)
- (Q5028363) (← links)
- (Q5204825) (← links)
- Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
- The power of the binary value principle (Q6057309) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)