Computational Complexity over the p -adic Numbers

ISSN： 0885-064X

Source： Journal of Complexity, Vol.13, Iss.2, 1997-02, pp. : 195-207

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

Digraph representations of rational functions over the p -adic numbers

By Diao Hansheng

P-Adic Numbers, Ultrametric Analysis, and Applications, Vol. 3, Iss. 1, 2011-01 ,pp. : 23-38

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Codes over p-adic Numbers and Finite Rings Invariant under the Full Affine Group

By Abdukhalikov K.S.

Finite Fields and Their Applications, Vol. 7, Iss. 4, 2001-10 ,pp. : 449-467

Elsevier

Access to resources Recommend Favorite

Complexity Theory and Genetics: The Computational Power of Crossing Over

By Pudlák P.

Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. : 201-223

Academic Press

Access to resources Recommend Favorite

Algebraic cycles on products of elliptic curves over p -adic fields

By Rosenschon Andreas

Mathematische Annalen, Vol. 339, Iss. 2, 2007-10 ,pp. : 241-249

Springer Publishing Company

Access to resources Recommend Favorite

Diversity of p-adic analytic manifolds

By Gartside P.M. Mohamad A.M.

Topology and its Applications, Vol. 125, Iss. 2, 2002-11 ,pp. : 323-333

Elsevier

Access to resources Recommend Favorite