707 search results - page 77 / 142 » The Nonhomomorphicity of Boolean Functions |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
ALGORITHMICA
2010
13 years 8 months ago
2010
Abstract Winfree's pioneering work led the foundations in the area of errorreduction in algorithmic self-assembly (Winfree and Bekbolatov in DNA Based Computers 9, LNCS, vol. ...
BIRTHDAY
2010
Springer
13 years 4 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 3 days 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 8 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...