Fully parallelized multi-prover protocols for NEXP-time
type: Item
instance of: scholarly article
title: Fully parallelized multi-prover protocols for NEXP-time
zbMATH Open document ID: 0877.68078
author: Dror Lapidot
author: Adi Shamir
published in: Journal of Computer and System Sciences
publication date: 1997-12-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1022050
zbMATH Keywords: multi-prover interactive proofs
MaRDI profile type: Publication
full work available at URL: jcss.1997.1238
OpenAlex ID: W2156867528
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Does co-NP have short interactive proofs ?
cites work: PSPACE is provable by two provers in one round
cites work: On the power of multi-prover interactive protocols
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Algebraic methods for interactive proof systems
DOI: 10.1006/JCSS.1997.1238
description: scientific article; zbMATH DE number 1022050