- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Polynomial Identity Testing for Depth 3 Circuits ; volume:16 ; number:2 ; pages:115-138 ; date:05.2007
Computational complexity ; 16, Heft 2, 115-138, 05.2007
- Creator
-
Kayal, Neeraj
Saxena, Nitin
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0226-9
- URN
-
urn:nbn:de:101:1-2021082908265748060519
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:32 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kayal, Neeraj
- Saxena, Nitin
- SpringerLink (Online service)
Other Objects (12)
Polynomial Identity Testing for Small Depth Circuits
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
On approximate polynomial identity testing and real root finding
Polynomial identity rings
Rings satisfying a polynomial identity
Testing of reversible circuits
[Testing of Reversible Circuits]
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Symbolic methods for testing digital circuits
Symbolic methods for testing digital circuits
Employing core regulatory circuits to define cell identity
Polynomial equality testing for terms with shared substructures
Polynomial Identity Testing for Small Depth Circuits
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
On approximate polynomial identity testing and real root finding
Polynomial identity rings
Rings satisfying a polynomial identity
Testing of reversible circuits
[Testing of Reversible Circuits]
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Symbolic methods for testing digital circuits
Symbolic methods for testing digital circuits
Employing core regulatory circuits to define cell identity
Polynomial equality testing for terms with shared substructures
Polynomial Identity Testing for Small Depth Circuits
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
On approximate polynomial identity testing and real root finding
Polynomial identity rings
Rings satisfying a polynomial identity
Testing of reversible circuits
[Testing of Reversible Circuits]
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits
Symbolic methods for testing digital circuits
Symbolic methods for testing digital circuits
Employing core regulatory circuits to define cell identity