Abstract
We study characterizations of algebraic complexity classes by branching programs of possibly exponential size, using a succinctness condition to replace the usual one based on uniformity. We obtain characterizations of VPSPACE, the class corresponding to computations in polynomial space, and observe that algebraic polynomial space can be seen as constant algebraic space with auxiliary polynomial space Boolean computations. We also obtain the first examples of natural complete polynomials for VPSPACE, in particular showing that polynomials like the determinant, the permanent or the Hamiltonian become VPSPACE-complete when the matrix is succinctly encoded. Using the same techniques we also characterize VNP. In general, we argue that characterizations by branching programs apply to different classes, both Boolean and algebraic, with or without uniformity, and thus provide a general and uniform technique in these different settings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, New York (2009)
Babai, L., Fortnow, L.: Arithmetization: A New Method in Structural Complexity Theory. Comput. Complexity 1(1), 41–66 (1991)
Ben-Or, M., Cleve, R.: Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1), 54–58 (1992)
Borodin, A.: On relating time and space to size and depth. SIAM Journal on Computing 6(4), 733–744 (1977), http://link.aip.org/link/?SMJ/6/733/1
Bürgisser, P.: Completeness and Reduction in Algebraic Complexity Theory, Algorithms and Computation in Mathematics, vol. 7. Springer, Berlin (2000)
Cai, J.-y., Furst, M.L.: Pspace survives constant-width bottlenecks. Int. J. Found. Comput. Sci. 2(1), 67–76 (1991)
Datta, S., Mahajan, M., Rao, B.V.R., Thomas, M., Vollmer, H.: Counting Classes and the Fine Structure between NC\(^{\mbox{1}}\) and L. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 306–317. Springer, Heidelberg (2010)
Galota, M., Vollmer, H.: Functions computable in polynomial space. Information and Computation 198(1), 56 (2005)
Galperin, H., Wigderson, A.: Succinct representations of graphs. Information and Control 56(3), 183 (1983)
von zur Gathen, J.: Feasible Arithmetic Computations: Valiant’s Hypothesis. J. Symb. Comput. 4(2), 137–172 (1987)
Hertrampf, U., Lautemann, C., Schwentick, T., Vollmer, H., Wagner, K.W.: On the power of polynomial time bit-reductions (extended abstract). In: Structure in Complexity Theory Conference, pp. 200–207 (1993)
Koiran, P., Perifel, S.: Vpspace and a transfer theorem over the reals. Computational Complexity 18(4), 551–575 (2009)
Mahajan, M., Rao, B.V.R.: Small-space analogues of valiant’s classes. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 250–261. Springer, Heidelberg (2009)
Malod, G.: The complexity of polynomials and their coefficient functions. In: IEEE Conference on Computational Complexity, pp. 193–204. IEEE Computer Society, Los Alamitos (2007)
Malod, G., Portier, N.: Characterizing valiant’s algebraic complexity classes. J. Complex. 24(1), 16–38 (2008)
Poizat, B.: A la recherche de la definition de la complexite d’espace pour le calcul des polynomes a la maniere de valiant. J. Symb. Log. 73(4), 1179–1201 (2008)
Ruzzo, W.L.: On uniform circuit complexity. Journal of Computer and System Sciences 22(3), 365–383 (1981)
Valiant, L.G.: Completeness Classes in Algebra. In: STOC 1979: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249–261. ACM Press, New York (1979)
Valiant, L.G.: Reducibility by Algebraic Projections. In: Logic and Algorithmic: an International Symposium held in honor of Ernst Specker. Monographies de l’Enseignement Mathémathique, vol. 30, pp. 365–380 (1982)
Valiant, L.G., Skyum, S., Berkowitz, S., Rackoff, C.: Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12(4), 641–644 (1983)
Veith, H.: Succinct representation, leaf languages, and projection reductions, Information and Computation 142(2), 207 (1998)
Venkateswaran, H.: Circuit Definitions of Nondeterministic Complexity Classes. SIAM J. Comput. 21(4), 655–670 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malod, G. (2011). Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. In: Owe, O., Steffen, M., Telle, J.A. (eds) Fundamentals of Computation Theory. FCT 2011. Lecture Notes in Computer Science, vol 6914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22953-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-22953-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22952-7
Online ISBN: 978-3-642-22953-4
eBook Packages: Computer ScienceComputer Science (R0)