P != NP for the Reals with Various Analytic Functions

Abstract

We show that non-deterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful than the corresponding deterministic machines. 
DOI: 10.1006/jcom.2000.0567

Cite this paper

@article{Prunescu2001PN, title={P != NP for the Reals with Various Analytic Functions}, author={Mihai Prunescu}, journal={J. Complexity}, year={2001}, volume={17}, pages={17-26} }