Symbolic Listings as Computation
Abstract: We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model algorithms are arithmetic formula expressing symbolic listings of YES instances of Boolean functions, and computation is executed via partial differential operators. We consider the Chow rank of an arithmetic formula as a measure of complexity and establish the Chow rank of multilinear polynomials with totally non-overlapping monomial support. We also provide Chow rank non-decreasing transformations from sets of graphs to sets of functional graphs.
- Manindra Agrawal and V. Vinay. Arithmetic circuits: A chasm at depth four. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pages 67–75, 2008.
- M. Ajtai. ∑\sum∑11-formulae on finite structures. Annals of Pure and Applied Logic, 24(1):1–48, 1983.
- George Boole. An Investigation of the Laws of Thought: On Which Are Founded the Mathematical Theories of Logic and Probabilities. Cambridge Library Collection - Mathematics. Cambridge University Press, 2009.
- An algorithmic method of partial derivatives, 2020.
- Partial derivatives in arithmetic complexity and beyond. Foundations and Trends® in Theoretical Computer Science, 6(1–2):1–138, 2011.
- Alonzo Church. On formally undecidable propositions of principia mathematica and related systems, by kurt gödel, translated by b. meltzer. Journal of Symbolic Logic, 30(3):357–359, 1965.
- Alonzo Church. In Edward N. Zalta and Uri Nodelman, editors, The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2023 edition, 2023.
- Arithmetic circuits: A chasm at depth 3. SIAM Journal on Computing, 45(3):1064–1079, 2016.
- Product ranks of the 3 × 3 determinant and permanent. Canadian Mathematical Bulletin, 59(2):311–319, June 2016.
- Ran Raz. Tensor-rank and lower bounds for arithmetic formulas. J. ACM, 60(6), nov 2013.
- Natural proofs. Journal of Computer and System Sciences, 55(1):24–35, 1997.
- Claude E. Shannon. A symbolic analysis of relay and switching circuits. Transactions of the American Institute of Electrical Engineers, 57(12):713–723, 1938.
- Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends® in Theoretical Computer Science, 5(3–4):207–388, 2010.
- A. M. Turing. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society, s2-42(1):230–265, 1937.
- L. G. Valiant and S. Skyum. Fast parallel computation of polynomials using few processors. In Jozef Gruska and Michal Chytil, editors, Mathematical Foundations of Computer Science 1981, pages 132–139, Berlin, Heidelberg, 1981. Springer Berlin Heidelberg.
- Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410–421, 1979.
- Volker Strassen Walter Baur. The complexity of partial derivatives. Theoretical Computer Science, 22:317–330, 1983.
- Ryan Williams. Non-uniform acc circuit lower bounds. In 2011 IEEE 26th Annual Conference on Computational Complexity, pages 115–125, 2011.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.