707 search results - page 71 / 142 » The Nonhomomorphicity of Boolean Functions |
APAL
2004
14 years 9 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
FMCAD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...