scientific article; zbMATH DE number 2077106

zbMATH Open1044.68652MaRDI QIDQ4470488FDOQ4470488

Authors: Jean-Marc Couveignes, Juan Francisco Diaz-Frias, Michel de Rougemont, Miklos Santha 

Publication date: 1 July 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 66620
• On the power of multi-prover interactive protocols
• scientific article; zbMATH DE number 4106274
• Round complexity versus randomness complexity in interactive proofs
• On the power of interaction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (3)

• Interactive proofs for social graphs
• Title not available (Why is that?)
• Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

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 Q4470488)