Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays

DOI10.1093/LOGCOM/EXN025zbMath1169.68016OpenAlexW2078740210MaRDI QIDQ3611731

Iain A. Stewart

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/5745/1/5745.pdf

zbMATH Keywords

finite model theorydescriptive complexityprogram schemes

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (1)

On the power of deep pushdown stacks

This page was built for publication: Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays