All about Ordering principle

Proof Systems

• The size complexity of Ordering principle in Resolution is polynomial
  • Source: Res → regRes → ordering
• The size complexity of Ordering principle in Truth table is exponential
  • Source: ordering → tlRes → ttp
• The size complexity of Ordering principle in Tree-like resolution is exponential
  • Source: [citation needed]
• The size complexity of Ordering principle in Regular resolution is polynomial
  • Source: Stalmarck96 Short Resolution Proofs for a Sequence of Tricky Formulas.
• The size complexity of Ordering principle in Ordered resolution is [missing?]
• The size complexity of Ordering principle in Pool resolution is polynomial
  • Source: poolRes → regRes → ordering
• The size complexity of Ordering principle in Linear resolution is polynomial
  • Source: BJ16 On Linear Resolution.
• The size complexity of Ordering principle in Reversible resolution is [missing?]
• The size complexity of Ordering principle in Cutting Planes is polynomial
  • Source: CP → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Tree-like Cutting Planes is [missing?]
• The size complexity of Ordering principle in Cutting Planes with Unary Coefficients is polynomial
  • Source: uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Semantic Cutting Planes is polynomial
  • Source: semanticCP → saturationCP → Res → regRes → ordering
• The size complexity of Ordering principle in Cutting Planes with Saturation is polynomial
  • Source: saturationCP → Res → regRes → ordering
• The size complexity of Ordering principle in Stabbing Planes is polynomial
  • Source: SP → uSP → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Stabbing Planes with Unary Coefficients is polynomial
  • Source: uSP → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Res(CP) is polynomial
  • Source: Res(CP) → CP → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Res(LP) is polynomial
  • Source: Res(LP) → uRes(LP) → Res → regRes → ordering
• The size complexity of Ordering principle in Res(CP) with unary coefficients is polynomial
  • Source: uRes(CP) → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in Res(LP) with unary coefficients is polynomial
  • Source: uRes(LP) → Res → regRes → ordering
• The size complexity of Ordering principle in Res(L\(\&\)P) is polynomial
  • Source: Res(L&P) → Res(LP) → uRes(LP) → Res → regRes → ordering
• The size complexity of Ordering principle in Res(L\(\&\)P) with unary coefficients is polynomial
  • Source: uRes(L&P) → uRes(LP) → Res → regRes → ordering
• The size complexity of Ordering principle in Semantic degree-k threshold system, treelike version is [missing?]
• The size complexity of Ordering principle in Polynomial Calculus over \(\mathbb{F}_2\) is polynomial
  • Source: PC_F2 → Res → regRes → ordering
• The size complexity of Ordering principle in Nullstellensatz over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Ordering principle in ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is polynomial
  • Source: ResLin_Z → uResLin_Z → ResLin_F2 → Res → regRes → ordering
• The size complexity of Ordering principle in unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is polynomial
  • Source: uResLin_Z → ResLin_F2 → Res → regRes → ordering
• The size complexity of Ordering principle in ResLin over \(\mathbb{F}_2\), Res(\(\oplus\)) is polynomial
  • Source: ResLin_F2 → Res → regRes → ordering
• The size complexity of Ordering principle in Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\)) is [missing?]
• The size complexity of Ordering principle in Polynomial Calculus over \(\mathbb{Q}\) is polynomial
  • Source: PC_Q → Res → regRes → ordering
• The size complexity of Ordering principle in Nullstellensatz over \(\mathbb{Q}\) is [missing?]
• The size complexity of Ordering principle in Hitting is exponential
  • Source: ordering → tlRes → hit
• The size complexity of Ordering principle in Lift and Project is polynomial
  • Source: L&P → uL&P → Res → regRes → ordering
• The size complexity of Ordering principle in Lift and Project with unary coefficients is polynomial
  • Source: uL&P → Res → regRes → ordering
• The size complexity of Ordering principle in Positivstellensatz Calculus is polynomial
  • Source: PSC → PS → SoS → PC_Q → Res → regRes → ordering
• The size complexity of Ordering principle in Positivstellensatz is polynomial
  • Source: PS → SoS → PC_Q → Res → regRes → ordering
• The size complexity of Ordering principle in Lovász--Schrijver (LS) is polynomial
  • Source: LS → L&P → uL&P → Res → regRes → ordering
• The size complexity of Ordering principle in Lovász--Schrijver with squares (LS\(_+\)) is polynomial
  • Source: LS+ → LS → L&P → uL&P → Res → regRes → ordering
• The size complexity of Ordering principle in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree is polynomial
  • Source: LSd+ → LS+ → LS → L&P → uL&P → Res → regRes → ordering
• The size complexity of Ordering principle in Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree is polynomial
  • Source: LSn+ → PSC → PS → SoS → PC_Q → Res → regRes → ordering
• The size complexity of Ordering principle in Cone Proof System is polynomial
  • Source: CPS → IPS → extFrege → extRes → Res → regRes → ordering
• The size complexity of Ordering principle in tl Lovász--Schrijver (LS) is [missing?]
• The size complexity of Ordering principle in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Ordering principle in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike is [missing?]
• The size complexity of Ordering principle in static Lovász--Schrijver (static LS) is [missing?]
• The size complexity of Ordering principle in static Lovász--Schrijver, with squares of linear functions (static LS\(_+\)) is [missing?]
• The size complexity of Ordering principle in static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\)) is [missing?]
• The size complexity of Ordering principle in Sum of Squares (Lasserre) is polynomial
  • Source: SoS → PC_Q → Res → regRes → ordering
• The size complexity of Ordering principle in Sherali--Adams is polynomial
  • Source: SA → circRes → Res → regRes → ordering
• The size complexity of Ordering principle in Circular resolution is polynomial
  • Source: circRes → Res → regRes → ordering
• The size complexity of Ordering principle in Unary Sherali--Adams is [missing?]
• The size complexity of Ordering principle in Ideal Proof System is polynomial
  • Source: IPS → extFrege → extRes → Res → regRes → ordering
• The size complexity of Ordering principle in Extended Frege is polynomial
  • Source: extFrege → extRes → Res → regRes → ordering
• The size complexity of Ordering principle in Extended resolution is polynomial
  • Source: extRes → Res → regRes → ordering
• The size complexity of Ordering principle in Frege is polynomial
  • Source: Frege → AC0Frege → Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in \(\mathrm{AC}^0\)-Frege is polynomial
  • Source: AC0Frege → Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in k-DNF Resolution is polynomial
  • Source: Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in \(\mathrm{TC}^0\)-Frege is polynomial
  • Source: TC0Frege → AC0Frege → Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in \(\mathrm{AC}^0\)-Frege with mod 2 axioms is polynomial
  • Source: AC0Frege+Mod2axioms → AC0Frege → Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in \(\mathrm{AC}^0\)-Frege with mod 2 gates is polynomial
  • Source: AC0(+)Frege → ResLin_F2 → Res → regRes → ordering
• The size complexity of Ordering principle in OBDD(join,weakening) is polynomial
  • Source: OBDDjoinweak → uCP → Res → regRes → ordering
• The size complexity of Ordering principle in LK is polynomial
  • Source: LK → Frege → AC0Frege → Res-k → Res → regRes → ordering
• The size complexity of Ordering principle in Zermelo-Fraenkl Set Theory with the Axiom of Choice is polynomial
  • Source: ZFC → extFrege → extRes → Res → regRes → ordering

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