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:
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!
Abstract 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.
AbstractList 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.
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.
Author Liberatore, P.
Cadoli, M.
Schaerf, M.
Donini, F.M.
Author_xml – sequence: 1
  givenname: M.
  surname: Cadoli
  fullname: Cadoli, M.
  organization: Dipt. di Inf. e Sistemistica, Rome Univ., Italy
– sequence: 2
  givenname: F.M.
  surname: Donini
  fullname: Donini, F.M.
– sequence: 3
  givenname: P.
  surname: Liberatore
  fullname: Liberatore, P.
– sequence: 4
  givenname: M.
  surname: Schaerf
  fullname: Schaerf, M.
BookMark eNpd0E1LxDAQBuAgK9hdPXkRvIgHL9J1Jmm-jlL8ggUv6zm0aSJdd9s1aUH_vVkqCJ6GYR6GmXdOZl3fOULOEZaIoO_W5ZICiCUCPyIZci5zrbmYkQwAVa5ZASdkHuMGkqKgM3LxkVf7fei_2l01tN37lW2DHdshnpJjX22jO_utC_L2-LAun_PV69NLeb_KLRV6yFF6ZBoUVIVVSnHUmkrOReO1bxRVrhDSg66xVsynQWWxaWpAXzuwvkC2IDfT3nTE5-jiYHZttG67rTrXj9FQBZRpqRK8_gc3_Ri6dJtRgqNkwHhCtxOyoY8xOG_2IX0Wvg2COURk1qU5RJT6g76cdOuc-5OCyQIE-wEDhGCj
CODEN ITCOB4
Cites_doi 10.1016/B978-0-444-88071-0.50007-2
10.1613/jair.664
10.1016/j.tcs.2005.02.002
10.1137/S0097539797323571
10.1023/A:1011481521835
10.1006/jcss.1997.1472
10.1145/584792.584833
10.1109/18.556672
10.1006/inco.2000.2914
10.1007/BF01683269
10.1006/inco.2001.3043
10.1093/bioinformatics/9.3.299
10.1016/B978-0-444-88071-0.50019-9
10.1109/TIT.2002.806118
10.1109/TIT.1978.1055873
10.1007/3-540-46541-3_17
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TC.2006.105
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9956
EndPage 917
ExternalDocumentID 2340502931
10_1109_TC_2006_105
1637406
Genre orig-research
GroupedDBID --Z
-DZ
-~X
.55
.DC
0R~
29I
3EH
3O-
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACNCT
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
MVM
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RXW
RZB
TAE
TN5
TWZ
UHB
UKR
UPT
VH1
X7M
XJT
XOL
XZL
YXB
YYQ
YZZ
ZCG
AAYXX
ABUFD
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c269t-17f139080a4c888519927556df9fd828e467f09b1b83f755ac1ddb01fbe0cf413
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000237631000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9340
IngestDate Sun Nov 09 14:22:01 EST 2025
Sun Jun 29 16:13:21 EDT 2025
Sat Nov 29 08:09:44 EST 2025
Wed Aug 27 02:49:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c269t-17f139080a4c888519927556df9fd828e467f09b1b83f755ac1ddb01fbe0cf413
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 865173035
PQPubID 85452
PageCount 5
ParticipantIDs proquest_journals_865173035
ieee_primary_1637406
proquest_miscellaneous_28023978
crossref_primary_10_1109_TC_2006_105
PublicationCentury 2000
PublicationDate 2006-July
2006-07-00
20060701
PublicationDateYYYYMMDD 2006-07-01
PublicationDate_xml – month: 07
  year: 2006
  text: 2006-July
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on computers
PublicationTitleAbbrev TC
PublicationYear 2006
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref10
ref2
ref1
ref17
ref16
ref18
ref8
ref7
ref4
ref3
ref6
ref5
Levenshtein (ref11) 1966; 10
Chen (ref9)
References_xml – ident: ref10
  doi: 10.1016/B978-0-444-88071-0.50007-2
– ident: ref4
  doi: 10.1613/jair.664
– ident: ref12
  doi: 10.1016/j.tcs.2005.02.002
– volume-title: Proc. 19th Int’l Joint Conf. Artificial Intelligence (IJCAI 2005)
  ident: ref9
  article-title: Parameterized Compilability
– ident: ref6
  doi: 10.1137/S0097539797323571
– ident: ref8
  doi: 10.1023/A:1011481521835
– ident: ref1
  doi: 10.1006/jcss.1997.1472
– volume: 10
  year: 1966
  ident: ref11
  article-title: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals
  publication-title: Soviet Physics Doklady
– ident: ref17
  doi: 10.1145/584792.584833
– ident: ref18
  doi: 10.1109/18.556672
– ident: ref15
  doi: 10.1006/inco.2000.2914
– ident: ref16
  doi: 10.1007/BF01683269
– ident: ref5
  doi: 10.1006/inco.2001.3043
– ident: ref13
  doi: 10.1093/bioinformatics/9.3.299
– ident: ref3
  doi: 10.1016/B978-0-444-88071-0.50019-9
– ident: ref7
  doi: 10.1109/TIT.2002.806118
– ident: ref2
  doi: 10.1109/TIT.1978.1055873
– ident: ref14
  doi: 10.1007/3-540-46541-3_17
SSID ssj0006209
Score 1.7775711
Snippet 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...
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...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 913
SubjectTerms Boolean functions
complexity measures and classes
Complexity theory
Directed graphs
models of computation
Reliability and testing
Title k-approximating circuits
URI https://ieeexplore.ieee.org/document/1637406
https://www.proquest.com/docview/865173035
https://www.proquest.com/docview/28023978
Volume 55
WOSCitedRecordID wos000237631000011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  customDbUrl:
  eissn: 1557-9956
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006209
  issn: 0018-9340
  databaseCode: RIE
  dateStart: 19680101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VigEGCi2opTwydCTUbmLHGVFFxYAqhoK6RbFjowgpRU2C-Pmc8yhIsLAlchJFZ9_5Pt_jA5hwj2tjuHI1VcL1EQC4UjCDKAURMwskMRUXwctjsFyK9Tp86sDNrhZGa10ln-lbe1nF8pONKu1R2RR9h8C3_bX3goDXtVo7q8vbdA6KCuz5pKnFoyScruZ10IFajrofu09Fp_LLBlcby6L3v186hqPGgXTu6hk_gY7O-tBryRmcRlf7cPij0-AAhm9u1T38M7UeavbqqHSryrTIT-F5cb-aP7gNKYKrZjwsXBoYdNrQz4t9heiV2fTRgDGemNAkCJ80Wj5DQkml8AwOxIomiSTUSE2UwS3rDLrZJtNDcIhQFh_6XqyZz2UgaSIoj4mSMyENVSOYtMKK3uveF1GFGUgYreaWwJLjPRvBwMrl-5FaJCMYt4KNGr3II8EZRZvi4UvXu1Fc0DZKEWd6U-bRzLakQ2x7_vdnx3BQn4LYjNkL6BbbUl_Cvvoo0nx7Va2JL91ns0Y
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4haKIeREEDosKBo5OWrd12NESCEYmHabgta9eaxWQYNox_vq_bQBK9eNvSbVle-17f1_fjAxhwmyutubQUlZ7lIACwhMc0ohREzMwVRBdcBK8zdz73Fgv_uQY321oYpVSRfKZuzWURy4-Xcm2OyoboO7iO6a-9xxxnRMpqra3d5ZuEDooqbDukqsajxB8G4zLsQA1L3c7-UxCq_LLCxdYyafzvp07guHIh-3flnJ9CTaVNaGzoGfqVtjbhaKfXYAva71bRP_wrMT5q-taXyUqukzw7g5fJfTCeWhUtgiVH3M8t6mp029DTixyJ-JWZBFKXMR5rX8cIoBTaPk18QYVnaxyIJI1jQagWikiNm9Y51NNlqtrQJ540CNGxI8UcLlxBY4_yiEgx8oSmsgODjbDCj7L7RVigBuKHwdhQWHK8Zx1oGbn8PFKKpAPdjWDDSjOy0OOMolWx8aXedhSXtIlTRKlarrNwZJrSIbq9-PuzPTiYBk-zcPYwf-zCYXkmYvJnL6Ger9bqCvblZ55kq-tifXwDX_W2jQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=k-Approximating+Circuits&rft.jtitle=IEEE+transactions+on+computers&rft.au=Donini%2C+F+M&rft.au=Liberatore%2C+P&rft.au=Schaerf%2C+M&rft.date=2006-07-01&rft.issn=0018-9340&rft.volume=55&rft.issue=7&rft.spage=913&rft.epage=917&rft_id=info:doi/10.1109%2FTC.2006.105&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9340&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9340&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9340&client=summon