All about Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget

Proof Systems

• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Truth table is exponential
  • Source: tseitin-and-k → tlTH(k) → tlCP → tlRes → ttp
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Tree-like resolution is exponential
  • Source: tseitin-and-k → tlTH(k) → tlCP → tlRes
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Regular resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Ordered resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Pool resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Linear resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Reversible resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Tree-like Cutting Planes is exponential
  • Source: tseitin-and-k → tlTH(k) → tlCP
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Cutting Planes with Unary Coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Semantic Cutting Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Cutting Planes with Saturation is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Stabbing Planes is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Stabbing Planes with Unary Coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(CP) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(LP) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(CP) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(LP) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(L\(\&\)P) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Res(L\(\&\)P) with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Semantic degree-k threshold system, treelike version is exponential
  • Source: BeamePS07 Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity.
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Polynomial Calculus over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Nullstellensatz over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in ResLin over \(\mathbb{F}_2\), Res(\(\oplus\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\)) is [missing?]
• 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{F}_2\) with k-ary AND gadget in Nullstellensatz over \(\mathbb{Q}\) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Hitting is exponential
  • Source: tseitin-and-k → tlTH(k) → tlCP → tlRes → hit
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lift and Project is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lift and Project with unary coefficients is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Positivstellensatz Calculus is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Positivstellensatz is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver (LS) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Cone Proof System is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in tl Lovász--Schrijver (LS) is exponential
  • Source: tseitin-and-k → tlTH(k) → tlLSd+ → tlLS+ → tlLS
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver with squares (LS\(_+\)) is exponential
  • Source: tseitin-and-k → tlTH(k) → tlLSd+ → tlLS+
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike is exponential
  • Source: tseitin-and-k → tlTH(k) → tlLSd+
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in static Lovász--Schrijver (static LS) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in static Lovász--Schrijver, with squares of linear functions (static LS\(_+\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\)) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Sum of Squares (Lasserre) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Sherali--Adams is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Circular resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Unary Sherali--Adams is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Ideal Proof System is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Extended Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Extended resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in \(\mathrm{AC}^0\)-Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in k-DNF Resolution is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in \(\mathrm{TC}^0\)-Frege is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in \(\mathrm{AC}^0\)-Frege with mod 2 axioms is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in \(\mathrm{AC}^0\)-Frege with mod 2 gates is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in OBDD(join,weakening) is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget in LK is [missing?]
• The size complexity of Tseitin over \(\mathbb{F}_2\) with k-ary AND gadget 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