scientific article; zbMATH DE number 7204372

DOI10.4230/LIPICS.MFCS.2017.38zbMATH Open1441.68299arXiv1705.00140MaRDI QIDQ5111252FDOQ5111252

Authors:

Publication date: 26 May 2020

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

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of checking identities for finite matrix rings
• New results on noncommutative and commutative polynomial identity testing
• On the factorization of non-commutative polynomials (in free associative algebras)
• Deterministic polynomial identity testing in non-commutative models
• Non-unique factorization of polynomials over residue class rings of the integers
• Factoring in skew-polynomial rings over finite fields
• A faster algorithm for testing polynomial representability of functions over finite integer rings
• Reduction-free multiplication for finite fields and polynomial rings
• On the relation between polynomial identity testing and finding variable disjoint factors
• Equivalence of polynomial identity testing and polynomial factorization

zbMATH Keywords

factorizationnoncommutative ringscircuitspolynomial 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)

Cites Work

• Factoring Polynomials Over Large Finite Fields
• Minimal Identities for Algebras
• Deterministic polynomial identity testing in non-commutative models
• Equivalence of polynomial identity testing and polynomial factorization
• Arithmetic circuits: a survey of recent results and open questions
• Computing Frobenius maps and factoring polynomials
• Noncommutative Unique Factorization Domains
• New results on noncommutative and commutative polynomial identity testing
• On the complexity of noncommutative polynomial factorization
• Some lower bound results for set-multilinear arithmetic computations
• Title not available (Why is that?)
• Non-commutative circuits and the sum-of-squares problem

Cited In (2)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111252)