706 search results - page 60 / 142 » On a quasi-ordering on Boolean functions |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. The classical view part...
CRYPTO
1990
Springer
14 years 1 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
AML
2008
13 years 9 months ago
2008
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...
ICCAD
1997
IEEE
14 years 1 months ago
1997
IEEE
In many veri cation techniques fast functional evaluation of a Boolean network is needed. We investigate the idea of using Binary Decision Diagrams BDDs for functional simulatio...