Vis enkel innførsel

dc.contributor.authorPrinz, Andreas
dc.date.accessioned2022-04-22T07:43:20Z
dc.date.available2022-04-22T07:43:20Z
dc.date.created2021-07-27T16:33:52Z
dc.date.issued2021
dc.identifier.citationPrinz, A. (2021). What is the Natural Abstraction Level of an Algorithm?. In: Raschke, A., Riccobene, E., Schewe, KD. (eds) Logic, Computation and Rigorous Methods. Lecture Notes in Computer Science(), vol 12750. Springer, Cham.en_US
dc.identifier.isbn978-3-030-76020-5
dc.identifier.urihttps://hdl.handle.net/11250/2992144
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.ispartofLogic, Computation and Rigorous Methods Essays Dedicated to Egon Börger on the Occasion of His 75th Birthday
dc.titleWhat is the Natural Abstraction Level of an Algorithm?en_US
dc.typeChapteren_US
dc.description.versionacceptedVersionen_US
dc.rights.holder© 2021 The Author(s)en_US
dc.subject.nsiVDP::Technology: 500::Information and communication technology: 550en_US
dc.source.pagenumber199-214en_US
dc.source.volume12750en_US
dc.source.journalLectures Notes in Computer Scienceen_US
dc.identifier.doihttps://doi.org/10.1007/978-3-030-76020-5_12
dc.identifier.cristin1922818
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel