scientific article; zbMATH DE number 3557235
From MaRDI portal
Publication:4133134
zbMath0357.68055MaRDI QIDQ4133134
Robert A. Reckhow, Stephen A. Cook
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items
Succinct non-interactive arguments via linear interactive proofs ⋮ Constant-Round Maliciously Secure Two-Party Computation in the RAM Model ⋮ Unnamed Item ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ The saga of minimum spanning trees ⋮ Shorter arithmetization of nondeterministic computations ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ Berechnung und Programm. II ⋮ Time bounded random access machines
