Computing with a fixed number of pointers (invited talk)

DOI10.4230/LIPICS.FSTTCS.2013.3MaRDI QIDQ2963894zbMATH OpenOpenAlexFDO

Authors Martin Hofmann, Ramyaa Ramyaa

Publication date 21 February 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2013.3

zbMATH Keywords

Cayley graphsco-st-connectivityjumping graph automatalogarithmic spacest-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• Hierarchies and space measures for pointer machines
• Pure Pointer Programs and Tree Isomorphism
• Parallel pointer machines
• Characterizing PSPACE with pointers
• Pure Pointer Programs with Iteration

Cited in

(4)

• Pure pointer programs with iteration
• Pure Pointer Programs with Iteration
• scientific article; zbMATH DE number 176163 (Why is no real title available?)
• Mathematics of Program Construction

This page was built for publication: Computing with a fixed number of pointers (invited talk)

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