Computing With a Fixed Number of Pointers (Invited Talk).
From MaRDI portal
Publication:2963894
DOI10.4230/LIPICS.FSTTCS.2013.3zbMath1359.68136OpenAlexW2249308842MaRDI QIDQ2963894
Publication date: 21 February 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2013.3
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
This page was built for publication: Computing With a Fixed Number of Pointers (Invited Talk).