Pages that link to "Item:Q5368766"
From MaRDI portal
The following pages link to Proof Complexity Lower Bounds from Algebraic Circuit Complexity (Q5368766):
Displaying 13 items.
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q2051373) (← links)
- Lower bounds: from circuits to QBF proof systems (Q2800571) (← links)
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness (Q4598235) (← links)
- (Q4612482) (← links)
- (Q4638077) (← links)
- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (Q4651502) (← links)
- (Q5028363) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q5092484) (← links)
- Proving Circuit Lower Bounds in High Uniform Classes (Q5417530) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997) (← links)