Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of gradient gate circuits

From MaRDI portal
Publication:4857749
Jump to:navigation, search

DOI10.1515/dma.1995.5.1.83zbMath0848.94024OpenAlexW1969291981MaRDI QIDQ4857749

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

gradient algorithmBoolean \(T\) table


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)








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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4857749&oldid=19208982"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 03:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki