Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
We introduce the classes IPR+ (resp. IPRx) as the class of languages that admit an interactive protocol on the reals when the verifier is a BSS-machine with addition (resp. addition and multiplication). Let BIPR+ (resp. BIPRx) its restriction when only boolean messages can be exchanged between the prover and the verifier. We prove that the classes BIPR+ and PARR+, the class of languages accepted in parallel polynomial time coincide. In the case of multiplicative machines, we show that BIPRx ⊆ PARRx). We also separate BIP R from IPR in both models by exhibiting a language L which is not in PARRx but in IPR+. As a consequence we show that additive quantifier elimination can't be solved in PARRx and that all boolean languages are in IPR+.
Original language | English |
---|---|
Title of host publication | STACS 98 - 15th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings |
Pages | 499-510 |
Number of pages | 12 |
DOIs | |
State | Published - 1 Dec 1998 |
Event | 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98 - Paris, France Duration: 25 Feb 1998 → 27 Feb 1998 |
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1373 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference | 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98 |
---|---|
Country/Territory | France |
City | Paris |
Period | 25/02/98 → 27/02/98 |
ID: 49986481