Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 11-XX Number theory
  • 11Yxx Computational number theory
  • 11Y40 Algebraic number theory computations

11Yxx Computational number theory

  • 11Y05 Factorization
  • 11Y11 Primality
  • 11Y16 Algorithms; complexity
  • 11Y35 Analytic computations
  • 11Y40 Algebraic number theory computations
  • 11Y50 Computer solution of Diophantine equations
  • 11Y55 Calculation of integer sequences
  • 11Y60 Evaluation of constants
  • 11Y65 Continued fraction calculations
  • 11Y70 Values of arithmetic functions; tables
  • 11Y99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 1 of 1

Showing per page

Алгоритм полиномиальной сложности для факторизации многочленов над локальными полями

А.Л. Чистов (1991)

Zapiski naucnych seminarov Leningradskogo

Currently displaying 1 – 1 of 1

Page 1

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7