Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata.

Clément Bertrand Cinzia Di Giusto Hanna Klaudel Damien Regnault

Published in: CONCUR (2023)

Keyphrases

problems involving
computational issues
database systems
database
data sets
information systems
computational complexity
optimization problems
np complete
memory requirements
random access
np hardness
complexity bounds
polynomial hierarchy