Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3

DOI10.3103/S0027132214030036zbMATH Open1337.94112OpenAlexW1979880130MaRDI QIDQ2018028FDOQ2018028

Authors: Yanyan Li 

Publication date: 24 March 2015

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132214030036

Recommendations

• On the synthesis and complexity of formulae with bounded depth of alternation
• On the complexity of realization of the linear function by formulas over finite Boolean bases
• On the complexity of realization of Boolean functions by formulas
• Complexity of implementation of Boolean functions by real-valued formulas
• scientific article; zbMATH DE number 4097290

Mathematics Subject Classification ID

Information theory (general) (94A15) Boolean functions (06E30)

Cites Work

• Finite state languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the synthesis and complexity of formulae with bounded depth of alternation
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• On the synthesis and complexity of formulae with bounded depth of alternation
• On the complexity of realization of finite languages by formulas

This page was built for publication: Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3

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