We show that P = PSPACE implies the collapse of the Boolean polynomial hier
archy over any structure which admits "efficient enumeration of sign condit
ions". This fairly rich class of structures contains in particular R and C.
(C) 2002 Elsevier Science B.V All rights reserved.