All about Tseitin over \(\mathbb{Q}\)

Proof Systems

• The size complexity of Tseitin over \(\mathbb{Q}\) in Resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Truth table is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Tree-like resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Regular resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Ordered resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Pool resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Linear resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Reversible resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Tree-like Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Cutting Planes with Unary Coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Semantic Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Cutting Planes with Saturation is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Stabbing Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Stabbing Planes with Unary Coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(CP) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(LP) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(CP) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(LP) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(L\(\&\)P) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Res(L\(\&\)P) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Semantic degree-k threshold system, treelike version is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Polynomial Calculus over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Nullstellensatz over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in ResLin over \(\mathbb{F}_2\), Res(\(\oplus\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\)) 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 Tseitin over \(\mathbb{Q}\) in Nullstellensatz over \(\mathbb{Q}\) is polynomial
  • Source: [citation needed]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Hitting is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lift and Project is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lift and Project with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Positivstellensatz Calculus is polynomial
  • Source: PSC → PS → SoS → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Positivstellensatz is polynomial
  • Source: PS → SoS → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver (LS) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree is polynomial
  • Source: LSn+ → PSC → PS → SoS → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Cone Proof System is polynomial
  • Source: CPS → LSn+ → PSC → PS → SoS → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in tl Lovász--Schrijver (LS) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in static Lovász--Schrijver (static LS) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in static Lovász--Schrijver, with squares of linear functions (static LS\(_+\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Sum of Squares (Lasserre) is polynomial
  • Source: SoS → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Sherali--Adams is polynomial
  • Source: SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Circular resolution is polynomial
  • Source: circRes → SA → NS_Q → tseitinQ
• The size complexity of Tseitin over \(\mathbb{Q}\) in Unary Sherali--Adams is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Ideal Proof System is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Extended Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Extended resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in \(\mathrm{AC}^0\)-Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in k-DNF Resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in \(\mathrm{TC}^0\)-Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in \(\mathrm{AC}^0\)-Frege with mod 2 axioms is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in \(\mathrm{AC}^0\)-Frege with mod 2 gates is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in OBDD(join,weakening) is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in LK is [missing?]
• The size complexity of Tseitin over \(\mathbb{Q}\) in Zermelo-Fraenkl Set Theory with the Axiom of Choice is [missing?]

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