A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model. - Time hierarchy theorem - Document - PDFSEARCH.IO

First Page	Meta Content
	A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model. Add to Reading List Document Date: 2013-10-06 09:48:25 Open Document File Size: 519,40 KB Share Result on Facebook IndustryTerm direct products / computing / signal processing / tensor products / mathematical tools / linear systems / smallest straight-line program computing / / Person Valiant / Ai / / Position VP in the discrete theory / VP vs VNP conjecture / class VP / discrete complexity classes VP / general / geometric setting / VP / SAUGATA BASU classes VP / complexity classes VP / VP vs VNP question / pushing forward / corresponding push-forward / classes VP / VP vs VNP / push-forward / / SocialTag Algebraic topology Structural complexity theory Field theory Time hierarchy theorem Constructible sheaf Algebraic geometry Sheaf Constructible function Constructible universe Abstract algebra

A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model.Add to Reading List