Abstract
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this paper, we consider the definability of functions from tuples of sets of non-negative integers to sets of non-negative integers by means of arithmetic circuits. We prove two negative results: the first shows, roughly, that a function is not circuit-definable if it has an infinite range and sub-linear growth; the second shows, roughly, that a function is not circuit-definable if it has a finite range and fails to converge on certain ‘sparse’ chains under inclusion. We observe that various functions of interest fall under these descriptions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Glaßer, C., Herr, K., Reitwießner, C., Travers, S., Waldherr, M.: Equivalence problems for circuits over sets of natural numbers. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 127–138. Springer, Heidelberg (2007)
Glaßer, C., Reitwießner, C., Travers, S., Waldherr, M.: Satisfiability of algebraic circuits over sets of natural numbers. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 253–264. Springer, Heidelberg (2007)
Harrow, K.: The bounded arithmetic hierarchy. Information and Control 36(1), 102–117 (1978)
Hartmanis, J., Shank, H.: On the recognition of primes by automata. Journal of the Association for Computing Machinery 15(3), 382–389 (1968)
Jeż, A., Okhotin, A.: Complexity of solutions of equations over sets of natural numbers. In: Albers, S., Weil, P. (eds.) Proceedings of STACS 2008, Internationales Begegnungs- und Forschungszentrum für Informatik, Schloß Dagstuhl. Dagstuhl Seminar Proceedings, vol. 08001, pp. 373–384 (2008)
Jeż, A., Okhotin, A.: On the computational completeness of equations over sets of natural numbers. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 63–74. Springer, Heidelberg (2008)
McKenzie, P., Wagner, K.: The complexity of membership problems for circuits over sets of natural numbers. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 571–582. Springer, Heidelberg (2003)
McKenzie, P., Wagner, K.: The complexity of membership problems for circuits over sets of natural numbers. Computational Complexity 16(3), 211–244 (2007)
Ritchie, R.: Classes of predictably computable functions. Transactions of the American Mathematical Society 106, 139–173 (1963)
Stockmeyer, L., Meyer, A.: Word problems requiring exponential time (preliminary report). In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, ACM Digital Library, pp. 1–9 (1973)
Travers, S.: The complexity of membership problems for circuits over sets of integers. Theoretical Computer Science 369, 211–229 (2006)
Yang, K.: Integer circuit evaluation is PSPACE-complete. In: Proceedings, 15th IEEE Conference on Computational Complexity, pp. 204–211. IEEE, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pratt-Hartmann, I., Düntsch, I. (2009). Functions Definable by Arithmetic Circuits. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)