k-Bounded Positive Not All Equal LE3-SAT

نویسندگان

  • Richard Denman
  • Barbara M. Anthony
چکیده

The not all equal (NAE) 3-SAT problem is known to be NP-complete even in the absence of negated variables (see [11]), a variant known as positive (or monotone) NAE 3-SAT. In this article, we investigate a related category, dubbed positive NAE LE3SAT (PNAE LE3-SAT), in which each clause has at most three variables, none of which is negated, and an assignment is sought that will satisfy such an expression in a way that meets the NAE restriction. We show that PNAE LE3-SAT is NP-complete even when no variable occurs more than three times (3B-PNAE LE3-SAT), and that PNAE LE3-SAT is in complexity class P when no variable occurs more than twice (2B-PNAE LE3-SAT).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Clausal Graphs to Determine the Computational Complexity of k-Bounded Positive 1-in-3 SAT

The 1-in-3 SAT problem is known to be NP-complete even in the absence of negated variables [1], a variant known as Positive (or Monotone) 1-in-3 SAT. In this note, we use clausal graphs to investigate a further restriction: kBounded-Positive 1-in-3 SAT (kBP 1-in-3 SAT), in which each variable occurs in no more than k clauses. We show that for k = 2, kBP 1-in-3 SAT is in the polynomial complexit...

متن کامل

NAE-SAT-based probabilistic membership filters

Probabilistic membership filters are a type of data structure designed to quickly verify whether an element of a large data set belongs to a subset of the data. While false negatives are not possible, false positives are. Therefore, the main goal of any good probabilistic membership filter is to have a small false-positive rate while being memory efficient and fast to query. Although Bloom filt...

متن کامل

On the Hardness and Easiness of Random 4-SAT Formulas

Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in that we show that approximating max bipartite clique is hard under the weaker assumption, that random 4-SAT formulas are hard to refute with high probability. On the positive side we present an efficient algorithm whic...

متن کامل

Complexity and Algorithms for Well-Structured k-SAT Instances

This paper consists of two conceptually related but independent parts. In the first part we initiate the study of k-SAT instances of bounded diameter. The diameter of an ordered CNF formula is defined as the maximum difference between the index of the first and the last occurrence of a variable. We investigate the relation between the diameter of a formula and the tree-width and the path-width ...

متن کامل

Amino acid sequence and characterization of a nuclease (nuclease Le3) from Lentinus edodes.

The fruit body of shiitake (Lentinus edodes) produces two acid nucleases, nuclease Le1 and nuclease Le3, both of which are thought to be candidates for the enzyme that produces a flavorful substance, 5'-GMP, and the primary structure of one of the nucleases, nuclease Le1, has been analyzed by both protein chemistry and gene cloning [Biosci. Biotechnol. Biochem. 64, 948-957 (2000)]. In this stud...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010