On the complexity of gradient gate circuits

DOI10.1515/DMA.1995.5.1.83MaRDI QIDQ4857749zbMATH OpenOpenAlexFDO

Authors Alexander E. Andreev

Publication date 15 January 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.1.83

zbMATH Keywords

Boolean \(T\) tablegradient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the (non) NP-hardness of computing circuit complexity
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 4114544
• On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity
• Relativized circuit complexity
• On asymptotic gate complexity and depth of reversible circuits without additional memory
• The new complexity landscape around circuit minimization
• Weighting gates in circuit complexity and holography
• scientific article; zbMATH DE number 3225719
• On the complexity of circuit satisfiability

Cited in

(1)

• On asymptotic gate complexity and depth of reversible circuits without additional memory

This page was built for publication: On the complexity of gradient gate circuits

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