Výsledky vyhľadávania - "syntax and semantics of Boolean circuits"

Through the mincing machine with a Boolean layer cake: Nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving

Autori: Edward G. Belaga

Zdroj: Acta Informatica. 26:381-407

Predmety: syntax and semantics of Boolean circuits, Switching theory, applications of Boolean algebras to circuits and networks, Networks and circuits as models of computation, circuit complexity, Analysis of algorithms and problem complexity, 4. Education, mincing complexity, locally synchronous CS-complexity, m-dimensional cyclic convolution, straight-line Boolean computations, relative circuit-size complexity of a Boolean function, 7. Clean energy

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/4055537
https://link.springer.com/article/10.1007/BF00276024
https://dblp.uni-trier.de/db/journals/acta/acta26.html#Belaga89