A Depth-Universal Circuit

DOI10.1137/0214058MaRDI QIDQ3691586zbMATH OpenOpenAlexFDO

Authors H. James Hoover, Stephen Cook

Publication date 1985

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0214058

zbMATH Keywords

Boolean circuitscomplexity classesparallel processing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Universal circuits (Preliminary Report)
• scientific article; zbMATH DE number 5666680
• Efficient Universal Quantum Circuits
• Depth reduction for circuits of unbounded fan-in
• A logic for constant-depth circuits

Cited in

(18)

• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
• From cryptomania to obfustopia through secret-key functional encryption
• Efficient and scalable universal circuits
• Unbounded dynamic predicate compositions in ABE from standard assumptions
• Breaking the circuit size barrier for secure computation under DDH
• From cryptomania to obfustopia through secret-key functional encryption
• Universal circuits (Preliminary Report)
• Constraining and watermarking PRFs from milder assumptions
• Efficient Universal Quantum Circuits
• Machines, Computations, and Universality
• Functional commitments for all functions, with transparent setup and from SIS
• Constrained pseudorandom functions from homomorphic secret sharing
• Time-release cryptography from minimal circuit assumptions
• How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
• Compact NIZKs from standard assumptions on bilinear maps
• Unbounded dynamic predicate compositions in ABE from standard assumptions
• Area-time tradeoffs for universal VLSI circuits
• Underapproximation for model-checking based on universal circuits

This page was built for publication: A Depth-Universal Circuit

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