All about Clique-Colouring composed with a permutation

Proof Systems

• The size complexity of Clique-Colouring composed with a permutation in Resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res
• The size complexity of Clique-Colouring composed with a permutation in Truth table is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → regRes → tlRes → ttp
• The size complexity of Clique-Colouring composed with a permutation in Tree-like resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → regRes → tlRes
• The size complexity of Clique-Colouring composed with a permutation in Regular resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → regRes
• The size complexity of Clique-Colouring composed with a permutation in Ordered resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → regRes → ordRes
• The size complexity of Clique-Colouring composed with a permutation in Pool resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → poolRes
• The size complexity of Clique-Colouring composed with a permutation in Linear resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → linRes
• The size complexity of Clique-Colouring composed with a permutation in Reversible resolution is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → revRes
• The size complexity of Clique-Colouring composed with a permutation in Cutting Planes is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Tree-like Cutting Planes is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Cutting Planes with Unary Coefficients is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP
• The size complexity of Clique-Colouring composed with a permutation in Semantic Cutting Planes is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Cutting Planes with Saturation is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → saturationCP
• The size complexity of Clique-Colouring composed with a permutation in Stabbing Planes is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Stabbing Planes with Unary Coefficients is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(CP) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(LP) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(CP) with unary coefficients is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(LP) with unary coefficients is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(L\(\&\)P) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Res(L\(\&\)P) with unary coefficients is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Semantic degree-k threshold system, treelike version is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Polynomial Calculus over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Nullstellensatz over \(\mathbb{F}_2\) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in unary ResLin over \(\mathbb{Q}\), ResLin, Resolution over linear equations over rationals is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in ResLin over \(\mathbb{F}_2\), Res(\(\oplus\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Tree-like ResLin over \(\mathbb{F}_2\), treelike Res(\(\oplus\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Polynomial Calculus over \(\mathbb{Q}\) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Nullstellensatz over \(\mathbb{Q}\) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Hitting is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → Res → regRes → tlRes → hit
• The size complexity of Clique-Colouring composed with a permutation in Lift and Project is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lift and Project with unary coefficients is exponential
  • Source: CliqueColouringperm → OBDDjoinweak → uCP → uL&P
• The size complexity of Clique-Colouring composed with a permutation in Positivstellensatz Calculus is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Positivstellensatz is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver (LS) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver with squares (LS\(_+^\infty\)), unbounded degree is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Cone Proof System is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in tl Lovász--Schrijver (LS) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver with squares (LS\(_+\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Lovász--Schrijver with squares (LS\(_+^d\)), bounded degree, treelike is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in static Lovász--Schrijver (static LS) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in static Lovász--Schrijver, with squares of linear functions (static LS\(_+\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in static Lovász--Schrijver, with squares of linear functions (static LS\(_+^n\)) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Sum of Squares (Lasserre) is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Sherali--Adams is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Circular resolution is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Unary Sherali--Adams is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Ideal Proof System is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Extended Frege is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Extended resolution is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in Frege is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in \(\mathrm{AC}^0\)-Frege is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in k-DNF Resolution is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in \(\mathrm{TC}^0\)-Frege is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in \(\mathrm{AC}^0\)-Frege with mod 2 axioms is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in \(\mathrm{AC}^0\)-Frege with mod 2 gates is [missing?]
• The size complexity of Clique-Colouring composed with a permutation in OBDD(join,weakening) is exponential
  • Source: Krajicek08 An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
• The size complexity of Clique-Colouring composed with a permutation in LK is [missing?]
• The size complexity of Clique-Colouring composed with a permutation 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