New inequality relations between depth and delay

DOI10.1515/DMA.1995.5.6.547MaRDI QIDQ4889733zbMATH OpenOpenAlexFDO

Authors V. M. Khrapchenko

Publication date 12 August 1996

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1995.5.6.547

zbMATH Keywords

circuit delaycircuit depthcomputational schememinimal circuit

Mathematics Subject Classification ID

Recommendations

• The fundamental difference between depth and delay
• The delay of circuits whose inputs have specified arrival times
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times
• On circuits of functional elements of finite depth of branching
• On the depth of Boolean functions over an arbitrary infinite basis

Cited in

(5)

• The fundamental difference between depth and delay
• Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates
• scientific article; zbMATH DE number 1205991 (Why is no real title available?)
• On the meaning of works by V. M. Khrapchenko
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times

This page was built for publication: New inequality relations between depth and delay

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