The Ideal Membership Problem in Non-Commutative Polynomial Rings

ISSN： 0747-7171

Source： Journal of Symbolic Computation, Vol.22, Iss.1, 1996-01, pp. : 27-48

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A polynomial algorithm for the membership problem with categorial grammars

By Finkel A. Tellier I.

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 207-221

Elsevier

Access to resources Recommend Favorite

Anti-isomorphisms, character modules and self-dual codes over non-commutative rings

By Wood Jay A.

International Journal of Information and Coding Theory, Vol. 1, Iss. 4, 2010-04 ,pp. : 429-444

Inderscience Publishers

Access to resources Recommend Favorite

Power properties of NLC graph grammars with a polynomial membership problem

By Flasinski M.

Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. : 189-231

Elsevier

Access to resources Recommend Favorite

Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic

By Polakow J. Pfenning F.

Electronic Notes in Theoretical Computer Science, Vol. 20, Iss. 1, 2004-01 ,pp. : 1-18

Elsevier

Access to resources Recommend Favorite

Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting

By Borges-Trenard M.A. Borges-Quintana M. Mora T.

Journal of Symbolic Computation, Vol. 30, Iss. 4, 2000-10 ,pp. : 429-449

Academic Press

Access to resources Recommend Favorite