The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis

We study the complexity of the following algorithmic problem: Given a Boolean function f and a finite set of Boolean functions B , decide if there is a circuit with basis B that computes  f . We show that if both f and all functions in B are given by their truth-table, the problem is in quasipolynom...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory of computing systems Jg. 44; H. 1; S. 82 - 90
1. Verfasser:	Vollmer, Heribert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer-Verlag 01.01.2009 Springer Nature B.V
Schlagworte:	Algebra Algorithms Boolean Circuits Codes Computer Science Mathematical analysis Studies Theory of Computation Post’s lattice Membership problem Clones Boolean circuit Computational complexity
ISSN:	1432-4350, 1433-0490
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!