707 search results - page 106 / 142 » The Nonhomomorphicity of Boolean Functions |
125
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
109
Voted
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
129
Voted
FMCAD
2009
Springer
15 years 10 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
126
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...
132
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...