scientific article; zbMATH DE number 3887074

MaRDI QIDQ3219765zbMATH OpenFDO

Authors Edouard G. Belaga

Publication date 1984

zbMATH Keywords

circuits over universal algebrascomputational functorsstraight-line algorithms

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Categories of machines, automata (18B20) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Recommendations

• Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving
• Universal circuits (Preliminary Report)
• Complex algebras of arithmetic
• Constructive universal algebra: An introduction
• On bounds for complexity of circuits of multi-input functional elements

Cited in

(5)

• Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving
• The size and depth of layered Boolean circuits
• Complex algebras of arithmetic
• Constructive universal algebra: An introduction
• Sublinear-communication secure multiparty computation does not require FHE

This page was built for publication:

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