Hide metadata

dc.date.accessioned2020-08-11T19:11:52Z
dc.date.created2020-03-21T05:36:15Z
dc.date.issued2020
dc.identifier.citationKristiansen, Lars . Reversible programming languages capturing complexity classes.. Lecture Notes in Computer Science (LNCS). 2020
dc.identifier.urihttp://hdl.handle.net/10852/78278
dc.description.abstractWe argue that there is a link between implicit computational complexity theory and the theory of reversible computation. We show that the complexity classes ETIME and P can be captured by inherently reversible programming languages.en_US
dc.languageEN
dc.titleReversible programming languages capturing complexity classes.en_US
dc.typeJournal articleen_US
dc.creator.authorKristiansen, Lars
dc.date.embargoenddate2021-07-09
cristin.unitcode185,15,5,25
cristin.unitnamePROG Programmering
cristin.ispublishedfalse
cristin.fulltextpostprint
cristin.qualitycode1
dc.identifier.cristin1802757
dc.identifier.bibliographiccitationinfo:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Lecture Notes in Computer Science (LNCS)&rft.volume=&rft.spage=&rft.date=2020
dc.identifier.jtitleLecture Notes in Computer Science (LNCS)
dc.identifier.startpage111
dc.identifier.endpage127
dc.identifier.doihttps://doi.org/10.1007/978-3-030-52482-1_6
dc.identifier.urnURN:NBN:no-81367
dc.type.documentTidsskriftartikkelen_US
dc.type.peerreviewedPeer reviewed
dc.source.issn0302-9743
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/78278/1/finalreverse.pdf
dc.type.versionAcceptedVersion


Files in this item

Appears in the following Collection

Hide metadata