971 search results - page 1 / 195 » Approximate Satisfiability and Equivalence |
LICS
2006
IEEE
13 years 10 months ago
2006
IEEE
STOC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
METRICS
1997
IEEE
13 years 9 months ago
1997
IEEE
An experiment comparing the effectiveness of equivalence partitioning (EP), boundary value analysis (BVA), and random testing was performed, based on an operational avionics syste...
JSAT
2006
13 years 4 months ago
2006
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...