Pure Pointer Programs with Iteration
From MaRDI portal
Publication:3540172
Recommendations
Cites work
- scientific article; zbMATH DE number 1670851 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- A new approach to abstract syntax with variable binding
- On the power of deterministic transitive closures
- Problems complete for deterministic logarithmic space
- Reachability and the power of local ordering
- STACS 2004
- Space Lower Bounds for Maze Threadability on Restricted Machines
- The Four Colour Theorem: Engineering of a Formal Proof
- Tight Lower Bounds for st-Connectivity on the NNJAG Model
- Undirected ST-connectivity in log-space
Cited in
(3)
This page was built for publication: Pure Pointer Programs with Iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540172)