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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on computers Ročník 55; číslo 7; s. 913 - 917
Hlavní autoři: Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2006
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Boolean functions
complexity measures and classes
Complexity theory
Directed graphs
models of computation
Reliability and testing
ISSN:0018-9340, 1557-9956
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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