Publication:4035692
From MaRDI portal
zbMath0773.68039MaRDI QIDQ4035692
Publication date: 18 May 1993
NP-completeinteractive proof systemsrational seriesprobabilistic finite state automata\(k\)-regular sequencesword problem for matrices
Related Items
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