Complexity classifications for different equivalence and audit problems for boolean circuits
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Boehler, Elmar; Creignou, Nadia; Galota, Matthias; Reith, Steffen; Schnoor, Henning et al.: Complexity classifications for different equivalence and audit problems for boolean circuits. In: Logical Methods in Computer Science 8 (2012), Nr. 3, 31. DOI: https://doi.org/10.2168/LMCS-8(3:31)2012
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Gottfried Wilhelm Leibniz Universität Hannover
- (when)
-
2012
- Event
-
Veröffentlichung
- (where)
-
Hannover
- (who)
-
Technische Informationsbibliothek (TIB)
- (when)
-
2012
- Creator
-
Boehler, Elmar
Creignou, Nadia
Galota, Matthias
Reith, Steffen
Schnoor, Henning
Vollmer, Heribert
- DOI
-
10.15488/1988
- URN
-
urn:nbn:de:101:1-2020072009001445994308
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 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
- Boehler, Elmar
- Creignou, Nadia
- Galota, Matthias
- Reith, Steffen
- Schnoor, Henning
- Vollmer, Heribert
- Gottfried Wilhelm Leibniz Universität Hannover
- Technische Informationsbibliothek (TIB)
Time of origin
- 2012
Other Objects (12)
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
Reducing Boolean networks with backward equivalence
Embedding Arbitrary Boolean Circuits into Fungal Automata
Boolean techniques in testing of digital circuits
Derandomizing RP if Boolean circuits are not learnable
Equivalence checking of quantum circuits by nonlocality
Publisher Correction: Equivalence checking of quantum circuits by nonlocality
From Boolean logic to switching circuits and automata : towards modern information technology
Boolean reasoning for digital circuits in presence of unknown values : application to test automation
Boolean algebras
Boolean Algebras
Boolean algebras
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
Reducing Boolean networks with backward equivalence
Embedding Arbitrary Boolean Circuits into Fungal Automata
Boolean techniques in testing of digital circuits
Derandomizing RP if Boolean circuits are not learnable
Equivalence checking of quantum circuits by nonlocality
Publisher Correction: Equivalence checking of quantum circuits by nonlocality
From Boolean logic to switching circuits and automata : towards modern information technology
Boolean reasoning for digital circuits in presence of unknown values : application to test automation
Boolean algebras
Boolean Algebras
Boolean algebras
Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits
Reducing Boolean networks with backward equivalence
Embedding Arbitrary Boolean Circuits into Fungal Automata
Boolean techniques in testing of digital circuits
Derandomizing RP if Boolean circuits are not learnable
Equivalence checking of quantum circuits by nonlocality
Publisher Correction: Equivalence checking of quantum circuits by nonlocality
From Boolean logic to switching circuits and automata : towards modern information technology
Boolean reasoning for digital circuits in presence of unknown values : application to test automation
Boolean algebras
Boolean Algebras