24 search results - page 1 / 5 » Some 3CNF properties are hard to test |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
BMCBI
2005
13 years 4 months ago
2005
Background: This paper addresses the problem of recognising DNA cis-regulatory modules which are located far from genes. Experimental procedures for this are slow and costly, and ...
SAT
2010
Springer
13 years 3 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
SFP
2003
13 years 6 months ago
2003
G∀ST is a fully automatic test system. Given a logical property, stated as a function, it is able to generate appropriate test values, to execute tests with these values, and to ...