Polynomial-time locality tests for finite rings

DOI10.1016/J.JALGEBRA.2013.01.010zbMATH Open1319.13019OpenAlexW2010924113MaRDI QIDQ376052FDOQ376052

Authors: Michał Staromiejski 

Publication date: 1 November 2013

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2013.01.010

Recommendations

• A note on locality of algebras
• Publication:3029185
• Algorithms for commutative algebras over the rational numbers
• Polynomial functions over finite commutative rings
• scientific article; zbMATH DE number 1071735

zbMATH Keywords

finite ringlocal algebradeterministic polynomial-time algorithmlocality test

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Computational aspects and applications of commutative rings (13P99) Local rings and semilocal rings (13H99) Finite commutative rings (13M99)

Cited In (3)

• A note on locality of algebras
• An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank
• A probabilistic algorithm to test local algebraic observability in polynomial time

This page was built for publication: Polynomial-time locality tests for finite rings

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