- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1420-8954
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Kayal, Neeraj
Saxena, Nitin
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-007-0226-9
- URN
-
urn:nbn:de:101:1-2021082908265748060519
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:32 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kayal, Neeraj
- Saxena, Nitin
- SpringerLink (Online service)
Ähnliche Objekte (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