Exponential Lower Bounds for the Tree-Like Hajós Calculus
نویسندگان
چکیده
The Hajj os Calculus is a simple, nondeterministic procedure which generates precisely the class of non-3-colorable graphs. In this note, we prove exponential lower bounds on the size of tree-like Hajj os constructions .
منابع مشابه
A Non-Hamiltonicity Proof System
To date, the field of proof complexity contains only one major example of a graph theoretic proof system, the Hajós Calculus. With the goal of further diversifying the field of proof complexity, we describe the ‘Non-Hamiltonicity Proof System’ (NHPS), for which we prove soundness, completeness, exponential lower bounds on necessary proof length, as well as a simulation by Tree Resolution.
متن کاملCapacity Bounds and High-SNR Capacity of the Additive Exponential Noise Channel With Additive Exponential Interference
Communication in the presence of a priori known interference at the encoder has gained great interest because of its many practical applications. In this paper, additive exponential noise channel with additive exponential interference (AENC-AEI) known non-causally at the transmitter is introduced as a new variant of such communication scenarios. First, it is shown that the additive Gaussian ch...
متن کاملImproving Strong Exponential Time Hypothesis lower bounds for tree-like resolution
A Strong Exponential Time Hypothesis lower bound for resolution has the form 2(1− k)n for some k-CNF on n variables such that k → 0 as k → ∞. For every large k we prove that there exists an unsatisfiable k-CNF formula on n variables which requires tree-like resolution refutations of size at least 2 ( 1−Õ(k−1/3) ) . This improves the previous bound of 2(1−Õ(k −1/4))n due to Beck and Impagliazzo ...
متن کاملExponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
The matrix cuts of Lovász and Schrijver are methods for tightening linear relaxations of zero-one programs by the addition of new linear inequalities. We address the question of how many new inequalities are necessary to approximate certain combinatorial problems with strong guarantees, and to solve certain instances of Boolean satisfiability. We show that relaxations of linear programs, obtain...
متن کاملLower Bounds for Cutting Planes Proofs with Small Coe cients
We consider small-weight Cutting Planes (CP) proofs; that is, Cutting Planes (CP) proofs with coeecients up to Poly(n). We use the well known lower bounds for monotone complexity to prove an exponential lower bound for the length of CP proofs, for a family of tautologies based on the clique function. Because Resolution is a special case of small-weight CP, our method also gives a new and simple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 54 شماره
صفحات -
تاریخ انتشار 1995