All about Polynomial Calculus over \(\mathbb{Q}\)

Notes: With twin variables \(\overline{x}=1-x\)

Proof Systems

• Polynomial Calculus over \(\mathbb{Q}\) stronger than Resolution
• Source: [citation needed]
• Source: PC_Q → NS_Q → ofPHP → Res
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Truth table
• Source: PC_Q → NS_Q → tlRes → ttp
• Source: PC_Q → Res → regRes → ordering → tlRes → ttp
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Tree-like resolution
• Source: PC_Q → NS_Q → tlRes
• Source: PC_Q → Res → regRes → ordering → tlRes
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Regular resolution
• Source: PC_Q → Res → regRes
• Source: PC_Q → NS_Q → ofPHP → Res → regRes
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Ordered resolution
• Source: PC_Q → Res → regRes → ordRes
• Source: PC_Q → Res → regRes → pearl → ordRes
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Pool resolution
• Source: PC_Q → Res → poolRes
• Source: PC_Q → NS_Q → ofPHP → Res → poolRes
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Linear resolution
• Source: PC_Q → Res → linRes
• Source: PC_Q → NS_Q → ofPHP → Res → linRes
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Reversible resolution
• Source: PC_Q → Res → revRes
• Source: PC_Q → NS_Q → ofPHP → Res → revRes
• Polynomial Calculus over \(\mathbb{Q}\) incomparable wrt Cutting Planes
• Source: PC_Q → NS_Q → tsQ+ind → CP
• Source: CP → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) not simulated by Tree-like Cutting Planes
• Source: PC_Q → Res → regRes → ordRes → peb+ind → tlCP
• Polynomial Calculus over \(\mathbb{Q}\) incomparable wrt Cutting Planes with Unary Coefficients
• Source: PC_Q → NS_Q → tsQ+ind → CP → uCP
• Source: uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Semantic Cutting Planes
• Source: semanticCP → CP → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Cutting Planes with Saturation
• Source: PC_Q → Res → saturationCP
• Source: PC_Q → NS_Q → ofPHP → Res → saturationCP
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Stabbing Planes
• Source: SP → uSP → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) incomparable wrt Stabbing Planes with Unary Coefficients
• Source: PC_Q → NS_Q → tsQ+ind → CP → uSP
• Source: uSP → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(CP)
• Source: Res(CP) → CP → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(LP)
• Source: Res(LP) → uRes(LP) → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(CP) with unary coefficients
• Source: uRes(CP) → uCP → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(LP) with unary coefficients
• Source: uRes(LP) → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(L\(\&\)P)
• Source: Res(L&P) → Res(LP) → uRes(LP) → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Res(L\(\&\)P) with unary coefficients
• Source: uRes(L&P) → uRes(LP) → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] Semantic degree-k threshold system, treelike version
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Polynomial Calculus over \(\mathbb{F}_2\)
• Source: PC_F2 → NS_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) incomparable wrt Nullstellensatz over \(\mathbb{F}_2\)
• Source: PC_Q → Res → regRes → ordRes → peb+ind → NS_F2
• Source: NS_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals
• Source: ResLin_Z → uResLin_Z → ResLin_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals
• Source: uResLin_Z → ResLin_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate ResLin over \(\mathbb{F}_2\), Res(\(\oplus\))
• Source: ResLin_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\))
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Nullstellensatz over \(\mathbb{Q}\)
• Source: [subsystem]
• Source: PC_Q → Res → regRes → ordRes → peb+ind → NS_Q
• Polynomial Calculus over \(\mathbb{Q}\) stronger than Hitting
• Source: PC_Q → NS_Q → tlRes → hit
• Source: PC_Q → Res → regRes → ordering → tlRes → hit
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] Lift and Project
• Polynomial Calculus over \(\mathbb{Q}\) not simulated by Lift and Project with unary coefficients
• Source: PC_Q → NS_Q → tsQ+ind → CP → uCP → uL&P
• Polynomial Calculus over \(\mathbb{Q}\) weaker than Positivstellensatz Calculus
• Source: PSC → PS → SoS → PC_Q
• Source: PSC → PS → SoS → SA → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) weaker than Positivstellensatz
• Source: PS → SoS → PC_Q
• Source: PS → SoS → SA → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Lovász--Schrijver (LS)
• Source: LS → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Lovász--Schrijver with squares (LS\(_+\))
• Source: LS+ → LS → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree
• Source: LSd+ → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) weaker than Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree
• Source: LSn+ → PSC → PS → SoS → PC_Q
• Source: LSn+ → LSd+ → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) weaker than Cone Proof System
• Source: CPS → LSn+ → PSC → PS → SoS → PC_Q
• Source: CPS → LSn+ → LSd+ → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] tl Lovász--Schrijver (LS)
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] Lovász--Schrijver with squares (LS\(_+\))
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike
• Polynomial Calculus over \(\mathbb{Q}\) [missing?] static Lovász--Schrijver (static LS)
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate static Lovász--Schrijver, with squares of linear functions (static LS\(_+\))
• Source: sLS+ → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\))
• Source: sLSn+ → sLS+ → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) weaker than Sum of Squares (Lasserre)
• Source: Berkholz18 The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs.
• Source: SoS → SA → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Sherali--Adams
• Source: SA → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Circular resolution
• Source: circRes → SA → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) not simulated by Unary Sherali--Adams
• Source: PC_Q → Res → sod+xor → uSA
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Ideal Proof System
• Source: IPS → extFrege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Extended Frege
• Source: extFrege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Extended resolution
• Source: extRes → extFrege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Frege
• Source: Frege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) not simulated by \(\mathrm{AC}^0\)-Frege
• Source: PC_Q → NS_Q → ofPHP → AC0Frege
• Polynomial Calculus over \(\mathbb{Q}\) not simulated by k-DNF Resolution
• Source: PC_Q → NS_Q → ofPHP → AC0Frege → Res-k
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate \(\mathrm{TC}^0\)-Frege
• Source: TC0Frege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate \(\mathrm{AC}^0\)-Frege with mod 2 axioms
• Source: AC0Frege+Mod2axioms → NS_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate \(\mathrm{AC}^0\)-Frege with mod 2 gates
• Source: AC0(+)Frege → ResLin_F2 → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate OBDD(join,weakening)
• Source: OBDDjoinweak → tseitin → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate LK
• Source: LK → Frege → PHP → PC_Q
• Polynomial Calculus over \(\mathbb{Q}\) does not simulate Zermelo-Fraenkl Set Theory with the Axiom of Choice
• Source: ZFC → extFrege → PHP → PC_Q

Formulas

• The size complexity of Pigeonhole principle in Polynomial Calculus over \(\mathbb{Q}\) is exponential
• Source: [citation needed]
• The size complexity of Pigeonhole principle with functionality axioms in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Pigeonhole principle with functionality and onto axioms in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → NS_Q → ofPHP
• The size complexity of Weak pigeonhole principle (2n pigeons, n holes) in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Weak pigeonhole principle (\(n^2\) pigeons, n holes) in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Bitwise pigeonhole principle in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Relativized pigeonhole principle (n,\(n^2\),n-1) in Polynomial Calculus over \(\mathbb{Q}\) is exponential
• Source: ALN16 Narrow Proofs May Be Maximally Long.
• The size complexity of Ordering principle in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → regRes → ordering
• The size complexity of Guarded ordering principle in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → poolRes → ordering+guard
• The size complexity of Tseitin over \(\mathbb{F}_2\) in Polynomial Calculus over \(\mathbb{Q}\) is exponential
• Source: BGIP01 Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes.
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → NS_Q → tseitinQ
• The size complexity of Flow in Polynomial Calculus over \(\mathbb{Q}\) is exponential
• Source: AR03 Lower Bounds for Polynomial Calculus: Non-Binomial Case.
• The size complexity of Tseitin \(\mathbb{F}_2\) \(\circ\) IND in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Tseitin \(\mathbb{Q}\) \(\circ\) IND in Polynomial Calculus over \(\mathbb{Q}\) is at most quasipolynomial
• Source: PC_Q → NS_Q → tsQ+ind
• The size complexity of Random CNF in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Clique-Colouring in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Clique-Colouring encoded as equalities in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Weak Clique-Colouring (2m clique, m colours) in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Weak Clique-Colouring (m^1/2 clique, log^2 m colours) in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Pebbling \(\circ\) IND in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → regRes → ordRes → peb+ind
• The size complexity of Pebbling \(\circ\) XOR, then guarded in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → poolRes → peb+xor+guard
• The size complexity of Stone formula in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → poolRes → stone
• The size complexity of String of pearls in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → regRes → pearl
• The size complexity of Sink of DAG \(\circ\) XOR in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
• Source: PC_Q → Res → sod+xor

This database is still incomplete; missing data may indicate either the information was not yet recorded or an open problem. Users are encouraged to contribute missing proof systems and/or relations at https://gitlab.com/proofcomplexityzoo/zoo.

Licensed under CC BY 4.0