Time and space measures for a complete graph computation model

MaRDI QIDQ6198038zbMATH OpenFDO

Authors Brian Courtehoute, Detlef Plump

Publication date 20 February 2024

Full work available at URL https://arxiv.org/abs/2212.11637, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?GCM2022.4

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Hierarchies and space measures for pointer machines
• On time versus space III
• A computational model for generic graph functions
• On similarity and duality of computation (I)
• Graph Turing machines

Cites work

• From imperative to rule-based graph programs
• Graph transformation. 9th international conference, ICGT 2016, in memory of Hartmut Ehrig, held as part of STAF 2016, Vienna, Austria, July 5--6, 2016. Proceedings
• Hierarchies and space measures for pointer machines
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• On the definition of an algorithm
• On time versus space III
• Space measures for storage modification machines
• Storage Modification Machines

This page was built for publication: Time and space measures for a complete graph computation model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6198038)