All about k-DNF Resolution

Proof Systems

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

Formulas

• The size complexity of Pigeonhole principle in k-DNF Resolution is exponential
• Source: PHP → fPHP → ofPHP → AC0Frege → Res-k
• The size complexity of Pigeonhole principle with functionality axioms in k-DNF Resolution is exponential
• Source: fPHP → ofPHP → AC0Frege → Res-k
• The size complexity of Pigeonhole principle with functionality and onto axioms in k-DNF Resolution is exponential
• Source: ofPHP → AC0Frege → Res-k
• The size complexity of Weak pigeonhole principle (2n pigeons, n holes) in k-DNF Resolution is [missing?]
• The size complexity of Weak pigeonhole principle (\(n^2\) pigeons, n holes) in k-DNF Resolution is [missing?]
• The size complexity of Bitwise pigeonhole principle in k-DNF Resolution is [missing?]
• The size complexity of Relativized pigeonhole principle (n,\(n^2\),n-1) in k-DNF Resolution is [missing?]
• The size complexity of Ordering principle in k-DNF Resolution is polynomial
• Source: Res-k → Res → regRes → ordering
• The size complexity of Guarded ordering principle in k-DNF Resolution is polynomial
• Source: Res-k → Res → poolRes → ordering+guard
• The size complexity of Tseitin over \(\mathbb{F}_2\) in k-DNF Resolution is exponential
• Source: tseitin → AC0Frege → Res-k
• 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{Q}\) in k-DNF Resolution is [missing?]
• The size complexity of Flow in k-DNF Resolution is [missing?]
• The size complexity of Tseitin \(\mathbb{F}_2\) \(\circ\) IND in k-DNF Resolution is [missing?]
• The size complexity of Tseitin \(\mathbb{Q}\) \(\circ\) IND in k-DNF Resolution is [missing?]
• The size complexity of Random CNF in k-DNF Resolution is [missing?]
• The size complexity of Clique-Colouring in k-DNF Resolution is [missing?]
• The size complexity of Clique-Colouring encoded as equalities in k-DNF Resolution is [missing?]
• The size complexity of Weak Clique-Colouring (2m clique, m colours) in k-DNF Resolution is [missing?]
• The size complexity of Weak Clique-Colouring (m^1/2 clique, log^2 m colours) in k-DNF Resolution is polynomial
• Source: ABE02 Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.
• The size complexity of Clique-Colouring composed with a permutation in k-DNF Resolution is [missing?]
• The size complexity of Pebbling \(\circ\) IND in k-DNF Resolution is polynomial
• Source: Res-k → Res → regRes → ordRes → peb+ind
• The size complexity of Pebbling \(\circ\) XOR, then guarded in k-DNF Resolution is polynomial
• Source: Res-k → Res → poolRes → peb+xor+guard
• The size complexity of Stone formula in k-DNF Resolution is polynomial
• Source: Res-k → Res → poolRes → stone
• The size complexity of String of pearls in k-DNF Resolution is polynomial
• Source: Res-k → Res → regRes → pearl
• The size complexity of Sink of DAG \(\circ\) XOR in k-DNF Resolution is polynomial
• Source: Res-k → 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