Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SIAMDM
2002

favoriteEmaildiscussreport

42views more SIAMDM 2002»

Testing Basic Boolean Formulae

13 years 4 months ago

Testing Basic Boolean Formulae

Download www.cs.tau.ac.il

Michal Parnas, Dana Ron, Alex Samorodnitsky

Real-time Traffic

SIAMDM 2002 |

claim paper

Related Content

» DistributionFree Testing Lower Bounds for Basic Boolean Functions

» Proclaiming Dictators and Juntas or Testing Boolean Formulae

» SAT and ATPG Boolean engines for formal hardware verification

» Automatic Abstraction for Intervals Using Boolean Formulae

» Encoding Quantified CSPs as Quantified Boolean Formulae

» Testing Properties of ConstraintGraphs

» Exploiting Locality in a TMS

» Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points

» Fault Tolerant Boolean Satisfiability

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	SIAMDM
Authors	Michal Parnas, Dana Ron, Alex Samorodnitsky

Comments (0)