A Complexity Theory of Constructible Functions and Sheaves

In this paper we introduce constructible analogs of the discrete complexity classes VP and VNP of sequences of functions. The functions in the new definitions are constructible functions on R n or C n . We define a class of sequences of constructible functions that play a role analogous to that of V...

Full description

Saved in:

Bibliographic Details
Published in:	Foundations of computational mathematics Vol. 15; no. 1; pp. 199 - 279
Main Author:	Basu, Saugata
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.02.2015 Springer Nature B.V
Subjects:	Analogs Applications of Mathematics Complexity Complexity theory Computational mathematics Computer Science Construction Economics Geometry Hierarchies Linear and Multilinear Algebras Math Applications in Computer Science Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Sequences Sheaves Primary 14P10 Adjoint functors Secondary 68W30 Polynomial hierarchy Constructible functions Constructible sheaves 14P25 Complexity classes
ISSN:	1615-3375, 1615-3383
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!