We provide some evidence that Unique -SAT is as hard to solve as general -SAT, where -SAT denotes the satisfiability problem for -CNFs and Unique SAT is the promise version where the given formula has or solutions. Namely, defining for each , a -time randomized algorithm for -SAT and, similarly, a -time randomized algorithm for Unique -SAT , we show that . As a corollary, we prove that, if Uniq...

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...

A total of 500 serum samples collected from cattle and buffaloes from various livestock farms in Punjab were analysed for brucella antigens. Out of these 500 sera, Rose Bengal Plate Test (RBPT) recorded 79(15.8%) positive. These RBPT positive samples were subjected to routine serum agglutination (SAT) and modified SAT (EDTA added) tests. The SAT showed 18(22.7%) positive, 42(53.1%) doubtful and...

The Satisfiability problem (SAT) is a famous NP-Complete problem, which consists of an assignment of Boolean variables (true or false) and some clauses formed of these variables. A clause is a disjunction of some Boolean literals and can be true if and only if any of them is true. A SAT instance is satisfied if and only if all the clauses are simultaneously true. As a generalization of SAT, the...

Surface air temperature (SAT) from four reanalysis/analysis datasets are analyzed and compared with the observed SAT from 11 stations in the Antarctic. It is found that the SAT variation from Goddard Institute for Space Studies (GISS) is the best to represent the observed SAT. Then we use the sea ice concentration (SIC) data from satellite measurements, the SAT data from the GISS dataset and st...

Although the sulfate/anion transporter (sat-1; SLC26A1) was isolated from a rat liver cDNA library by expression cloning, localization of sat-1 within the liver and its contribution to the transport of sulfate and organo sulfates have remained unresolved. In situ hybridization and immunohistochemical studies were undertaken to demonstrate the localization of sat-1 in liver tissue. RT-PCR studie...

Logic locking is used to protect integrated circuits (ICs) from piracy and counterfeiting. An encrypted IC implements the correct function only when right key input. Many existing logic-locking methods are subject powerful satisfiability (SAT)-based attack. Recently, an Anti-SAT scheme has been developed. By adopting two complementary logic blocks that consist of AND/NAND trees, it makes number...

We show that polynomial time truth-table reducibility via Boolean circuits to SAT is the same as logspace truth-table reducibility via Boolean formulas to SAT and the same as logspace Turing reducibility to SAT. In addition, we prove that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. We give an oracle relative to which ∆p2 is not equal to...

This special issue comprises six papers devoted to SAT solving and three papers devoted to MAXSAT solving. With two exception, the papers contain detailed information about some of the best solvers from the 5th SAT solver competition and from the 2nd MAX-SAT solver competition, which took place as side event of the 10th International Conference on Theory and Applications of Satisfiability Testi...