Pages that link to "Item:Q1377580"

The following pages link to Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580):

Displaying 31 items.

• Towards NP-P via proof complexity and search (Q408544) (← links)
• Propositional proofs and reductions between NP search problems (Q435190) (← links)
• Algebraic proofs over noncommutative formulas (Q642520) (← links)
• Algebraic proof systems over formulas. (Q1401356) (← links)
• Hard examples for the bounded depth Frege proof system (Q1430570) (← links)
• Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
• A bounded arithmetic AID for Frege systems (Q1977488) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
• Random resolution refutations (Q2311546) (← links)
• Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481) (← links)
• A framework for space complexity in algebraic proof systems (Q2796410) (← links)
• A reduction of proof complexity to computational complexity for 𝐴𝐶⁰[𝑝] Frege systems (Q2944868) (← links)
• Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
• (Q3001100) (← links)
• Phase transition of multivariate polynomial systems (Q3616213) (← links)
• Approximation and Small-Depth Frege Proofs (Q4027856) (← links)
• Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700) (← links)
• Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
• Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
• (Q5028363) (← links)
• Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
• Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724) (← links)
• On the Complexity of Verifying Regular Properties on Flat Counter Systems, (Q5327431) (← links)
• Uniformly generated submodules of permutation modules over fields of characteristic 0. (Q5939910) (← links)
• Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity (Q5941296) (← links)
• Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090) (← links)
• Complexity of Null- and Positivstellensatz proofs (Q5957910) (← links)
• Propositional proof complexity (Q6064569) (← links)
• Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
• First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
• Extended Nullstellensatz proof systems (Q6621298) (← links)