scientific article; zbMATH DE number 3557235

MaRDI QIDQ4133134zbMATH OpenFDO

Authors Robert A. Reckhow, Stephen Cook

Publication date 1972

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(12)

• Scalable zero knowledge via cycles of elliptic curves
• Time bounded random access machines
• Constant-round maliciously secure two-party computation in the RAM model
• Succinct non-interactive arguments via linear interactive proofs
• Berechnung und Programm. II
• Constant-round maliciously secure two-party computation in the RAM model
• The saga of minimum spanning trees
• Shorter arithmetization of nondeterministic computations
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
• One-tape Turing machine and branching program lower bounds for MCSP
• One-tape Turing machine and branching program lower bounds for MCSP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133134)