Boolean reducibility

DOI10.1515/156939203322556018MaRDI QIDQ4809631zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322556018

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On the structure of partially ordered sets of Boolean degrees
• On maximal and minimal elements of partially ordered sets of Boolean degrees
• BOOLEAN CLASSES OF TURING REDUCTIONS
• scientific article; zbMATH DE number 63263
• scientific article; zbMATH DE number 4053594

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Complete degrees of finite-state transformability
• Degrees of finite-state transformability

Cited in

(7)

• Reductions for monotone Boolean circuits
• Some comments on infinite Boolean functions
• Join-irreducible Boolean functions
• On the structure of partially ordered sets of Boolean degrees
• Reducibility by means of almost polynomial functions
• BOOLEAN CLASSES OF TURING REDUCTIONS
• On maximal and minimal elements of partially ordered sets of Boolean degrees

This page was built for publication: Boolean reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809631)