scientific article; zbMATH DE number 7204372

DOI10.4230/LIPIcs.MFCS.2017.38zbMath1441.68299arXiv1705.00140MaRDI QIDQ5111252

No author found.

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1705.00140

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

factorizationcircuitsnoncommutative ringspolynomial identity testingnonassociative rings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Free nonassociative algebras (17A50) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (2)

Lower bounds for arithmetic circuits via the Hankel matrix ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees

Cites Work

• Unnamed Item
• Unnamed Item
• New results on noncommutative and commutative polynomial identity testing
• Deterministic polynomial identity testing in non-commutative models
• On the complexity of noncommutative polynomial factorization
• Equivalence of polynomial identity testing and polynomial factorization
• Computing Frobenius maps and factoring polynomials
• Arithmetic Circuits: A survey of recent results and open questions
• Noncommutative Unique Factorization Domains
• Factoring Polynomials Over Large Finite Fields
• Minimal Identities for Algebras
• Non-commutative circuits and the sum-of-squares problem

This page was built for publication: