Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers

DOI10.1007/S00224-007-2034-7zbMath1127.68040OpenAlexW2074733683MaRDI QIDQ2642916

Daniel Meister

Publication date: 6 September 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-2034-7

zbMATH Keywords

PSPACE-decidable membership problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recurrences (11B37) Decidability of theories and sets of sentences (03B25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers