k-approximating circuits

In this paper, we define and study the k-approximating circuits. A circuit accepting a given set of inputs A is k-approximated by accepting inputs that lifter from one of A by at most k bits. We show that the existence of polynomial-size k-approximating circuits depends on the relation between k and...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 55; H. 7; S. 913 - 917
Hauptverfasser: Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Boolean functions
complexity measures and classes
Complexity theory
Directed graphs
models of computation
Reliability and testing
ISSN:0018-9340, 1557-9956
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we define and study the k-approximating circuits. A circuit accepting a given set of inputs A is k-approximated by accepting inputs that lifter from one of A by at most k bits. We show that the existence of polynomial-size k-approximating circuits depends on the relation between k and the number of inputs.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2006.105