✦ LIBER ✦

On affine (non)equivalence of Boolean functions

✍ Scribed by Sugata Gangopadhyay; Deepmala Sharma; Sumanta Sarkar; Subhamoy Maitra

Publisher: Springer Vienna
Year: 2009
Tongue: English
Weight: 233 KB
Volume: 85
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s00607-009-0041-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalence classes of invertible Boolea

Equivalence classes of invertible Boolean functions

✍ É. A. Primenko 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 440 KB

On the Computational Complexity of Some

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

✍ B. Borchert; D. Ranjan; F. Stephan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 193 KB

Non-self-equivalent constructivization o

Non-self-equivalent constructivization of atomic Boolean algebras

✍ S. S. Goncharov 📂 Article 📅 1976 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 333 KB

The equivalence of Horn and network comp

The equivalence of Horn and network complexity for Boolean functions

✍ Stal O. Anderaa; Egon Börger 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

Evaluation of Boolean functions on noisy

Evaluation of Boolean functions on noisy input

✍ A. N. Efimov; E. V. Luk-Zil'berman 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 819 KB

On analytic equivalence of functions at

On analytic equivalence of functions at infinity

✍ Grzegorz Skalski 📂 Article 📅 2011 🏛 Elsevier Science 🌐 French ⚖ 143 KB

In this paper we define the relation of analytic equivalence of functions at infinity. We prove that if the Łojasiewicz exponent at infinity of the gradient of a polynomial f ∈ R[x 1 , . . . , x n ] is greater or equal to k -1, then there exists ε > 0 such that for every polynomial P ∈ R[x 1 , . . .