Interactive protocols over the reals

DOI10.1007/S000370050003MaRDI QIDQ1587345zbMATH OpenOpenAlexFDO

Authors Sergei Ivanov, Michel de Rougemont

Publication date 20 November 2000

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000370050003

zbMATH Keywords

interactive protocolinteractive proof

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of computing (68Q99)

Recommendations

• Interactive proofs and a Shamir-like result for real number computations
• Some results on interactive proofs for real computations
• Real interactive proofs for VPSPACE
• scientific article; zbMATH DE number 66620
• scientific article; zbMATH DE number 512981

Cited in

(3)

• Interactive proofs and a Shamir-like result for real number computations
• Some results on interactive proofs for real computations
• Real interactive proofs for VPSPACE

This page was built for publication: Interactive protocols over the reals

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