707 search results - page 76 / 142 » The Nonhomomorphicity of Boolean Functions |
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
ENGL
2008
13 years 8 months ago
2008
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
CAV
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...