Document Open Access Logo

Circuit Evaluation for Finite Semirings

Authors Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey

PDF
Thumbnail PDF

File

LIPIcs.STACS.2017.35.pdf
  • Filesize: 0.51 MB
  • 14 pages

Document Identifiers

Author Details

Moses Ganardi
Danny Hucke
Daniel König
Markus Lohrey

Cite AsGet BibTex

Moses Ganardi, Danny Hucke, Daniel König, and Markus Lohrey. Circuit Evaluation for Finite Semirings. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.STACS.2017.35

Abstract

The circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring R (i) has a solvable multiplicative semigroup and (ii) does not contain a subsemiring with an additive identity 0 and a multiplicative identity 1 != 0, then its circuit evaluation problem is in the complexity class DET (which is contained in NC^2). In all other cases, the circuit evaluation problem is P-complete.
Keywords
  • circuit value problem
  • finite semirings
  • circuit complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Eric Allender, Jia Jiao, Meena Mahajan, and V. Vinay. Non-commutative arithmetic circuits: Depth reduction and size lower bounds. Theor. Comput. Sci., 209(1-2):47-86, 1998. Google Scholar
  2. Jorge Almeida, Stuart Margolis, Benjamin Steinberg, and Mikhail Volkov. Representation theory of finite semigroups, semigroup radicals and formal language theory. Transactions of the American Mathematical Society, 361(3):1429-1461, 2009. Google Scholar
  3. Carme Àlvarez, José L. Balcázar, and Birgit Jenner. Functional oracle queries as a measure of parallel time. In Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1991, volume 480 of Lecture Notes in Computer Science, pages 422-433. Springer, 1991. Google Scholar
  4. Sanjeev Arora and Boaz Barak. Computational Complexity - A Modern Approach. Cambridge University Press, 2009. Google Scholar
  5. Karl Auinger and Benjamin Steinberg. Constructing divisions into power groups. Theoretical Computer Science, 341(1-3):1-21, 2005. Google Scholar
  6. Martin Beaudry and Markus Holzer. The complexity of tensor circuit evaluation. Computational Complexity, 16(1):60-111, 2007. Google Scholar
  7. Martin Beaudry and Pierre McKenzie. Circuits, matrices, and nonassociative computation. Journal of Computer and System Sciences, 50(3):441-455, 1995. Google Scholar
  8. Martin Beaudry, Pierre McKenzie, Pierre Péladeau, and Denis Thérien. Finite monoids: From word to circuit evaluation. SIAM Journal on Computing, 26(1):138-152, 1997. Google Scholar
  9. S. Buss, S. Cook, A. Gupta, and V. Ramachandran. An optimal parallel algorithm for formula evaluation. SIAM Journal on Computing, 21(4):755-780, 1992. Google Scholar
  10. Stephan A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2-22, 1985. Google Scholar
  11. Stephen A. Cook and Lila Fontes. Formal theories for linear algebra. Logical Methods in Computer Science, 8(1), 2012. Google Scholar
  12. Moses Ganardi, Danny Hucke, Daniel König, and Markus Lohrey. Circuit evaluation for finite semirings. Technical report, arXiv.org, 2016. URL: http://arxiv.org/abs/1602.04560.
  13. Jonathan S. Golan. Semirings and their Applications. Springer, 1999. Google Scholar
  14. Leslie M. Goldschlager. The monotone and planar circuit value problems are log space complete for P. SIGACT News, 9(2):25-99, 1977. Google Scholar
  15. Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995. Google Scholar
  16. Neil D. Jones and William T. Laaser. Complete problems for deterministic polynomial time. Theor. Comput. Sci., 3(1):105-117, 1976. Google Scholar
  17. Daniel König and Markus Lohrey. Evaluating matrix circuits. In Proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, volume 9198 of Lecture Notes in Computer Science, pages 235-248. Springer, 2015. Google Scholar
  18. S. Rao Kosaraju. On parallel evaluation of classes of circuits. In Proceedings of the 10th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1990, volume 472 of Lecture Notes in Computer Science, pages 232-237. Springer, 1990. Google Scholar
  19. Richard E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18-20, 1975. Google Scholar
  20. Markus Lohrey. The Compressed Word Problem for Groups. SpringerBriefs in Mathematics. Springer, 2014. Google Scholar
  21. Donald J. McCarthy and David L. Hayes. Subgroups of the power semigroup of a group. Journal of Combinatorial Theory, Series A, 14(2):173-186, 1973. Google Scholar
  22. Pierre McKenzie and Klaus W. Wagner. The complexity of membership problems for circuits over sets of natural numbers. Computational Complexity, 16(3):211-244, 2007. Google Scholar
  23. Gary L. Miller, Vijaya Ramachandran, and Erich Kaltofen. Efficient parallel evaluation of straight-line code and arithmetic circuits. SIAM J. Comput., 17(4):687-695, 1988. Google Scholar
  24. Gary L. Miller and Shang-Hua Teng. Tree-based parallel algorithm design. Algorithmica, 19(4):369-389, 1997. URL: http://dx.doi.org/10.1007/PL00009179.
  25. Gary L. Miller and Shang-Hua Teng. The dynamic parallel complexity of computational circuits. SIAM J. Comput., 28(5):1664-1688, 1999. Google Scholar
  26. Cristopher Moore, Denis Thérien, François Lemieux, Joshua Berman, and Arthur Drisko. Circuits and expressions with nonassociative gates. J. Comput. Syst. Sci., 60(2):368-394, 2000. Google Scholar
  27. Vijaya Ramachandran and Honghua Yang. An efficient parallel algorithm for the general planar monotone circuit value problem. SIAM J. Comput., 25(2):312-339, 1996. Google Scholar
  28. John Rhodes and Benjamin Steinberg. The q-theory of Finite Semigroups. Springer, 2008. Google Scholar
  29. Alexander A. Rubtsov and Mikhail N. Vyalyi. Regular realizability problems and context-free languages. In Proceedings of the 17th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2015, volume 9118 of Lecture Notes in Computer Science, pages 256-267. Springer, 2015. Google Scholar
  30. Stephen D. Travers. The complexity of membership problems for circuits over sets of integers. Theor. Comput. Sci., 369(1-3):211-229, 2006. Google Scholar
  31. Leslie G. Valiant, Sven Skyum, S. Berkowitz, and Charles Rackoff. Fast parallel computation of polynomials using few processors. SIAM J. Comput., 12(4):641-644, 1983. Google Scholar
  32. Heribert Vollmer. The gap-language-technique revisited. In Proceedings of the 4th Workshop on Computer Science Logic, CSL'90, volume 533 of Lecture Notes in Computer Science, pages 389-399. Springer, 1990. Google Scholar
  33. Heribert Vollmer. Introduction to Circuit Complexity. Springer, 1999. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact