Browsing by Author "Alaev P."

Sort by: Order: Results:

  • Computability on linear orderings enriched with predicates 
    Alaev P.; Thurber J.; Frolov A. (2009)
    Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computable presentation for L or for the structure (L, adj), where adj(x, y) is a predicate distinguishing adjacent elements. © ...
  • Polynomial Computability of Fields of Algebraic Numbers 
    Alaev P.; Selivanov V. (2018)
    © 2018, Pleiades Publishing, Ltd. We prove that the field of complex algebraic numbers and the ordered field of real algebraic numbers have isomorphic presentations computable in polynomial time. For these presentations, ...

Search DSpace

Browse

My Account