4255 search results - page 540 / 851 » On Learning Boolean Functions |
196
click to vote
CIE
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
192
click to vote
SOFSEM
2007
Springer
16 years 23 days ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
206
click to vote
ASPLOS
2006
ACM
16 years 19 days ago
2006
ACM
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
192
click to vote
SIGECOM
2006
ACM
16 years 18 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
187
click to vote
COCO
2005
Springer
16 years 5 days ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...