scientific article
From MaRDI portal
Publication:4035692
zbMath0773.68039MaRDI QIDQ4035692
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-completeinteractive proof systemsrational seriesprobabilistic finite state automata\(k\)-regular sequencesword problem for matrices
Related Items (3)
On the complexity of partially observed Markov decision processes ⋮ The complexity of approximating a nonlinear program ⋮ The complexity of the max word problem and the power of one-way interactive proof systems
This page was built for publication:
