351 search results - page 66 / 71 » On the Learnability of Boolean Formulae |
137
click to vote
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
TACAS
2007
Springer
15 years 7 months ago
2007
Springer
Analysis of biological data often requires an understanding of components of pathways and/or networks and their mutual dependency relationships. Such systems are often analyzed and...
136
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
103
click to vote
BIRTHDAY
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
118
click to vote
AAAI
2010
15 years 1 months ago
2010
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...