logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

k-approximating circuits

delete2006-07-01
delete2
PRE
AI
F
Francesco M. Donini
P
Paolo Liberatore
M
Marco Schaerf
DOI：10.1109/TC.2006.105delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 differ 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.
Keywords:
reliability and testing
complexity measures and classes
models of computation

Journal

IEEE Transactions on Computers cover
IEEE Transactions on Computers
IF:
3.8
Papers:
5.3K
Citations:
9.8K

Organization

No organization information available