Two function algebras defining functions in NCk boolean circuits

We describe the functions computed by boolean circuits in NCk by means of functions algebra for k≥1 in the spirit of implicit computational complexity. The whole hierarchy defines NC. In other words, we give a recursion-theoretic characterization of the complexity classes NCk for k≥1 without referen...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information and computation Ročník 248; s. 82 - 103
Hlavní autori: Bonfante, Guillaume, Kahle, Reinhard, Marion, Jean-Yves, Oitavem, Isabel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.06.2016
Predmet:
Boolean circuits
formula omitted
Parallel computation class
Transducers
Transducers
Boolean circuits
Parallel computation class
NCk
ISSN:0890-5401, 1090-2651
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We describe the functions computed by boolean circuits in NCk by means of functions algebra for k≥1 in the spirit of implicit computational complexity. The whole hierarchy defines NC. In other words, we give a recursion-theoretic characterization of the complexity classes NCk for k≥1 without reference to a machine model, nor explicit bounds in the recursion schema. Actually, we give two equivalent descriptions of the classes NCk, k≥1. One is based on a tree structure à la Leivant, the other is based on words. This latter puts into light the role of computation of pointers in circuit complexity. We show that transducers are a key concept for pointer evaluation.
AbstractList We describe the functions computed by boolean circuits in NCk by means of functions algebra for k≥1 in the spirit of implicit computational complexity. The whole hierarchy defines NC. In other words, we give a recursion-theoretic characterization of the complexity classes NCk for k≥1 without reference to a machine model, nor explicit bounds in the recursion schema. Actually, we give two equivalent descriptions of the classes NCk, k≥1. One is based on a tree structure à la Leivant, the other is based on words. This latter puts into light the role of computation of pointers in circuit complexity. We show that transducers are a key concept for pointer evaluation.
Author Bonfante, Guillaume
Marion, Jean-Yves
Kahle, Reinhard
Oitavem, Isabel
Author_xml – sequence: 1
  givenname: Guillaume
  surname: Bonfante
  fullname: Bonfante, Guillaume
  email: bonfante@loria.fr
  organization: LORIA, BP239, 615, rue du jardin botanique, 54506 Villers-lès-Nancy, France
– sequence: 2
  givenname: Reinhard
  surname: Kahle
  fullname: Kahle, Reinhard
  email: kahle@mat.uc.pt
  organization: CMA and DM, FCT-UNL, Monte de Caparica, 2829-516 Caparica, Portugal
– sequence: 3
  givenname: Jean-Yves
  surname: Marion
  fullname: Marion, Jean-Yves
  email: jean-yves.marion@loria.fr
  organization: LORIA, BP239, 615, rue du jardin botanique, 54506 Villers-lès-Nancy, France
– sequence: 4
  givenname: Isabel
  surname: Oitavem
  fullname: Oitavem, Isabel
  email: oitavem@fct.unl.pt
  organization: CMA and DM, FCT-UNL, Monte de Caparica, 2829-516 Caparica, Portugal
BookMark eNo9kMFKxDAURYOMYGd07zI_0Ppek6aNK6XoKAy6GdchTV-GjCWFpqO_bwfF1b1w4Vw4a7aKYyTGbhEKBFR3xyK4ogSsCiwLAH3BMgQNeakqXLEMmqVXEvCKrVM6AiBWUmXsYf89cn-Kbg5j5HY4UDfZxHvyIYZ4-J8SD5G_tZ-8G8eBbOQuTO4U5nTNLr0dEt385YZ9PD_t25d89759bR93OaFQc-4qUlrWVhEILSSoxgtHvdckS_QaGpLOedHXqrO90qoUta20R1eDlRal2LD7Xy4tJ1-BJpNcoLgwwkRuNv0YDII5uzBHE5w5uzBYmsWF-AGYcVUS
ContentType Journal Article
Copyright 2016 Elsevier Inc.
Copyright_xml – notice: 2016 Elsevier Inc.
DOI 10.1016/j.ic.2015.12.009
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1090-2651
EndPage 103
ExternalDocumentID S089054011500139X
GrantInformation_xml – fundername: FCT
  grantid: PTDC/FIL-FCI/109991/2009; PTDC/MHC-FIL/5363/2012
  funderid: http://dx.doi.org/10.13039/501100001871
– fundername: FCT
  grantid: PTDC/MHC-FIL/2583/2014; UID/MAT/00297/2013
  funderid: http://dx.doi.org/10.13039/501100001871
– fundername: ANR
  grantid: ANR-14-CE25-0005
  funderid: http://dx.doi.org/10.13039/501100001665
GroupedDBID --K
--M
--Z
-~X
.~1
0R~
1B1
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
E3Z
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
H~9
IHE
IXB
J1W
KOM
LG5
LX9
M41
MHUIS
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
WUQ
XJT
XPP
ZMT
ZU3
ZY4
~G-
ID FETCH-LOGICAL-e136t-c5e6947a6e03934068f3cedf9e421f908e4ccf3d76bad696237a59f1c70a4a143
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000375424800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0890-5401
IngestDate Fri Feb 23 02:25:03 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Transducers
Boolean circuits
Parallel computation class
NCk
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-e136t-c5e6947a6e03934068f3cedf9e421f908e4ccf3d76bad696237a59f1c70a4a143
PageCount 22
ParticipantIDs elsevier_sciencedirect_doi_10_1016_j_ic_2015_12_009
PublicationCentury 2000
PublicationDate June 2016
PublicationDateYYYYMMDD 2016-06-01
PublicationDate_xml – month: 06
  year: 2016
  text: June 2016
PublicationDecade 2010
PublicationTitle Information and computation
PublicationYear 2016
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Ruzzo (br0200) 1981; 22
Bellantoni, Cook (br0030) 1992; 2
Cobham (br0080) 1962
Immerman (br0130) 1998
Girard (br0110) 1998; 143
Balcázar, Díaz, Gabarró (br0010) 1990; vol. 22
Clote (br0070) 1990
Sakarovitch (br0210) 2009
Goldreich (br0120) 2008
Leivant (br0160) 1998
Edmonds (br0090) 1965; 17
Mogbil, Rahli (br0190) 2007; vol. 4514
Bonfante, Kahle, Marion, Oitavem (br0050) 2008; vol. 5213
Leivant, Marion (br0170) 2000; 236
Marion (br0180) 2009; 5
Bloch (br0040) 1994; 4
Leivant (br0150) 1993
Leivant (br0140) 1991
Bellantoni (br0020) 1995; vol. 960
Chandra, Kozen, Stockmeyer (br0060) 1981; 28
Elgot, Mezei (br0100) Jan. 1965; 9
Simmons (br0220) 1988; 27
References_xml – volume: 27
  start-page: 177
  year: 1988
  end-page: 188
  ident: br0220
  article-title: The realm of primitive recursion
  publication-title: Arch. Math. Log.
– volume: 2
  start-page: 97
  year: 1992
  end-page: 110
  ident: br0030
  article-title: A new recursion-theoretic characterization of the poly-time functions
  publication-title: Comput. Complex.
– year: 1991
  ident: br0140
  article-title: A foundational delineation of computational feasibility
  publication-title: Proceedings of the Sixth IEEE Symposium on Logic in Computer Science
– start-page: 716
  year: 1998
  end-page: 724
  ident: br0160
  article-title: A characterization of NC by tree recurrence
  publication-title: Foundations of Computer Science 1998
– volume: vol. 22
  year: 1990
  ident: br0010
  article-title: Structural Complexity II
  publication-title: EATCS Monographs of Theoretical Computer Science
– volume: vol. 960
  start-page: 253
  year: 1995
  end-page: 268
  ident: br0020
  article-title: Characterizing parallel time by type 2 recursions with polynomial output length
  publication-title: Logic and Computational Complexity
– volume: 9
  start-page: 47
  year: Jan. 1965
  end-page: 68
  ident: br0100
  article-title: On relations defined by generalized finite automata
  publication-title: IBM J. Res. Dev.
– year: 2008
  ident: br0120
  article-title: Computational Complexity: A Conceptual Perspective
– volume: 4
  start-page: 175
  year: 1994
  end-page: 205
  ident: br0040
  article-title: Function-algebraic characterizations of log and polylog parallel time
  publication-title: Comput. Complex.
– volume: 22
  start-page: 365
  year: 1981
  end-page: 383
  ident: br0200
  article-title: On uniform circuit complexity
  publication-title: J. Comput. Syst. Sci.
– year: 2009
  ident: br0210
  article-title: Elements of Automata Theory
– volume: vol. 4514
  start-page: 401
  year: 2007
  end-page: 421
  ident: br0190
  article-title: Uniform circuits, & boolean proof nets
  publication-title: LFCS
– start-page: 49
  year: 1990
  end-page: 69
  ident: br0070
  article-title: Sequential, machine independent characterizations of the parallel complexity classes
  publication-title: Feasible Mathematics
– start-page: 24
  year: 1962
  end-page: 30
  ident: br0080
  article-title: The intrinsic computational difficulty of functions
  publication-title: Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science
– volume: 143
  start-page: 175
  year: 1998
  end-page: 204
  ident: br0110
  article-title: Light linear logic
  publication-title: Inf. Comput.
– volume: 236
  start-page: 192
  year: 2000
  end-page: 208
  ident: br0170
  article-title: A characterization of alternating log time by ramified recurrence
  publication-title: Theor. Comput. Sci.
– volume: 28
  start-page: 114
  year: 1981
  end-page: 133
  ident: br0060
  article-title: Alternation
  publication-title: J. ACM
– year: 1993
  ident: br0150
  article-title: Stratified functional programs and computational complexity
  publication-title: Twentieth Annual ACM Symposium on Principles of Programming Languages
– volume: vol. 5213
  year: 2008
  ident: br0050
  article-title: Recursion schemata for
  publication-title: CSL '08
– year: 1998
  ident: br0130
  article-title: Descriptive Complexity
– volume: 17
  start-page: 449
  year: 1965
  end-page: 467
  ident: br0090
  article-title: Paths, trees, and flowers
  publication-title: Can. J. Math.
– volume: 5
  year: 2009
  ident: br0180
  article-title: On tiered small jump operators
  publication-title: Log. Methods Comput. Sci.
SSID ssj0011546
Score 2.1111798
Snippet We describe the functions computed by boolean circuits in NCk by means of functions algebra for k≥1 in the spirit of implicit computational complexity. The...
SourceID elsevier
SourceType Publisher
StartPage 82
SubjectTerms Boolean circuits
formula omitted
Parallel computation class
Transducers
Title Two function algebras defining functions in NCk boolean circuits
URI https://dx.doi.org/10.1016/j.ic.2015.12.009
Volume 248
WOSCitedRecordID wos000375424800005&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1090-2651
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0011546
  issn: 0890-5401
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nj9MwELXKLgc48LGA-JYP3KqgOHad-MayWsQuUkFikcopcpwxylJS1KZlT_x2xrGdtuICSFyiymkby_M0fhm_mSHkBXAhteU6yTnoRFQ1T5SBIklrYTNRG2lA980m8um0mM3Uh9HoZ8yF2czzti2urtT3_2pqHENju9TZvzD38Kc4gJ_R6HhFs-P1zwz_YzF2u5VvAT7_4k6GV-MabN8KYrjV62CnJ1_HSLPnLhxvmqVZN76wU6SrIVmpi5pl0_eA2Du8f71orbNOH2Bfux5G628DWN655sreik0bE_hD9YLGn_ef47OTz5utlPF90-kN9DA9W-kqSPpDYILJrYDKR8tixsyeoDMtVOrEGP574J1uimOZDIVng1fOfAHO4Fd9g6KwQ7O-KsLvzt_HIS5fNq40JZv0Yd5UbTe6QX740c3CTQLZsKPAs2vkMMsnCr3i4fHZ6ex8OIdiIdUrzjocdHuF4P5zdtjMDkO5uENuhVcLeuwhcZeMoD0it2PbDhq8-BG5uVOD8h55hXihERQ04oVGvAy3VrRpKeKFBrzQiJf75NOb04uTt0loq5EA47JLzASkErmW4PKykdAVlhuorQKRMavSAoQxlte5rHQtFfLjXE-UZSZPtdDIrx-Qg3bRwkNClebWVKbILAhhZVVwZoBba4UVdab5I8LjmpSB0XmmVqLNyigwvCwbU7qVLFlW4ko-_qdfPSE3tih8Sg665Rqeketm0zWr5fNg2F-trXGd
linkProvider Elsevier
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=Two+function+algebras+defining+functions+in+NCk+boolean+circuits&rft.jtitle=Information+and+computation&rft.au=Bonfante%2C+Guillaume&rft.au=Kahle%2C+Reinhard&rft.au=Marion%2C+Jean-Yves&rft.au=Oitavem%2C+Isabel&rft.date=2016-06-01&rft.pub=Elsevier+Inc&rft.issn=0890-5401&rft.eissn=1090-2651&rft.volume=248&rft.spage=82&rft.epage=103&rft_id=info:doi/10.1016%2Fj.ic.2015.12.009&rft.externalDocID=S089054011500139X
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-5401&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-5401&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-5401&client=summon