Elimination of parameters in the polynomial hierarchy

Abstract : Blum, Cucker, Shub and Smale have shown that the problem ``$\p = \np$~?'' has the same answer in all algebraically closed fields of characteristic~0. We generalize this result to the polynomial hierarchy: if it collapses over an algebraically closed field of characteristic 0, then it must collapse at the same level over all algebraically closed fields of characteristic 0. The main ingredient of their proof was a theorem on the elimination of parameters, which we also extend to the polynomial hierarchy. Similar but somewhat weaker results hold in positive characteristic. The present paper updates a report (LIP Research Report 97-37) with the same title, and in particular includes new results on interactive protocols and boolean parts.
Document type :
Reports
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02101807
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:06:49 AM
Last modification on : Tuesday, May 21, 2019 - 1:28:49 AM

File

RR1998-15.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101807, version 1

Collections

Citation

Pascal Koiran. Elimination of parameters in the polynomial hierarchy. [Research Report] LIP RR-1998-15, Laboratoire de l'informatique du parallélisme. 1998, 2+18p. ⟨hal-02101807⟩

Share

Metrics

Record views

9

Files downloads

31