The following pages link to (Q4228469):
Displaying 50 items.
- Polynomials for classification trees and applications (Q257540) (← links)
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- Propositional proofs and reductions between NP search problems (Q435190) (← links)
- Obtaining and solving systems of equations in key variables only for the small variants of AES (Q626949) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials (Q1030264) (← links)
- Good degree bounds on Nullstellensatz refutations of the induction principle (Q1276164) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Space bounds for resolution (Q1854472) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Another look at degree lower bounds for polynomial calculus (Q2333803) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← 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)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- (Q3304105) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations (Q3637268) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Algebraic Attacks against Random Local Functions and Their Countermeasures (Q4600698) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4625692) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- (Q5028363) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- (Q5092479) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
