scientific article; zbMATH DE number 3745100

zbMATH Open0474.94040MaRDI QIDQ3931334FDOQ3931334

Authors: Kh. A. Madatyan 

Publication date: 1980

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3423920
• scientific article; zbMATH DE number 4097288
• The complexity of the realization of subdefinite matrices by gate schemes
• scientific article; zbMATH DE number 3225719
• Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
• Publication:4729729
• Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates
• A matrix representation of quantum circuits over non-adjacent qudits
• Representing \((0,1)\)-matrices by Boolean circuits
• scientific article; zbMATH DE number 4114544

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (2)

• THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
• An infinitary polynomial Hales-Jewett theorem

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 Q3931334)