The complexity of the descriptiveness of Boolean circuits over different sets of gates
From MaRDI portal
Publication:2464338
DOI10.1007/s00224-006-1301-3zbMath1148.68026OpenAlexW2055594799MaRDI QIDQ2464338
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1301-3
Related Items
THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS ⋮ The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis ⋮ On the complexity of the clone membership problem