Set-reconstructibility of Post classes

Miguel Couceiro; Erkko Lehtonen; Karsten Schölzel

doi:10.1016/j.dam.2015.02.013

Set-reconstructibility of Post classes

Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel

Mathematics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaining clones are not weakly reconstructible.

Original language	British English
Pages (from-to)	12-18
Number of pages	7
Journal	Discrete Applied Mathematics
Volume	187
DOIs	https://doi.org/10.1016/j.dam.2015.02.013
State	Published - 31 May 2015

Keywords

Boolean function
Clone
Reconstruction problem

Access to Document

10.1016/j.dam.2015.02.013

Cite this

@article{31494dff367742b7a5b10fece9d7bd60,

title = "Set-reconstructibility of Post classes",

abstract = "The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaining clones are not weakly reconstructible.",

keywords = "Boolean function, Clone, Reconstruction problem",

author = "Miguel Couceiro and Erkko Lehtonen and Karsten Sch{\"o}lzel",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2015",

month = may,

day = "31",

doi = "10.1016/j.dam.2015.02.013",

language = "British English",

volume = "187",

pages = "12--18",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Set-reconstructibility of Post classes

AU - Couceiro, Miguel

AU - Lehtonen, Erkko

AU - Schölzel, Karsten

PY - 2015/5/31

Y1 - 2015/5/31

N2 - The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaining clones are not weakly reconstructible.

AB - The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaining clones are not weakly reconstructible.

KW - Boolean function

KW - Clone

KW - Reconstruction problem

UR - http://www.scopus.com/inward/record.url?scp=84928206487&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2015.02.013

DO - 10.1016/j.dam.2015.02.013

M3 - Article

AN - SCOPUS:84928206487

SN - 0166-218X

VL - 187

SP - 12

EP - 18

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Set-reconstructibility of Post classes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this