dc.contributor.author | Prinz, Andreas | |
dc.date.accessioned | 2022-04-22T07:43:20Z | |
dc.date.available | 2022-04-22T07:43:20Z | |
dc.date.created | 2021-07-27T16:33:52Z | |
dc.date.issued | 2021 | |
dc.identifier.citation | Prinz, 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.isbn | 978-3-030-76020-5 | |
dc.identifier.uri | https://hdl.handle.net/11250/2992144 | |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.relation.ispartof | Logic, Computation and Rigorous Methods Essays Dedicated to Egon Börger on the Occasion of His 75th Birthday | |
dc.title | What is the Natural Abstraction Level of an Algorithm? | en_US |
dc.type | Chapter | en_US |
dc.description.version | acceptedVersion | en_US |
dc.rights.holder | © 2021 The Author(s) | en_US |
dc.subject.nsi | VDP::Technology: 500::Information and communication technology: 550 | en_US |
dc.source.pagenumber | 199-214 | en_US |
dc.source.volume | 12750 | en_US |
dc.source.journal | Lectures Notes in Computer Science | en_US |
dc.identifier.doi | https://doi.org/10.1007/978-3-030-76020-5_12 | |
dc.identifier.cristin | 1922818 | |
cristin.qualitycode | 1 | |