scientific article; zbMATH DE number 512803
From MaRDI portal
Publication:4281496
zbMath0820.68047MaRDI QIDQ4281496
Publication date: 7 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Affine automata verifiers ⋮ Constant-space quantum interactive proofs against multiple provers ⋮ Interactive proofs with quantum finite automata ⋮ An application of quantum finite automata to interactive proof systems ⋮ Verifiable Stream Computation and Arthur--Merlin Communication
This page was built for publication: