你即將離開本站

並前往https://arxiv.org/abs/2011.10978

[2011.10978] On algorithms to find p-ordering - arXiv

We focus on the complexity of finding a p-ordering given a prime p, an exponent k and a subset of integers modulo p^k.

確定！ 回上一頁

查詢 「Find the letter n」的人也找了：

  1. Find the letter
    2.
  2. Find The letter X
    3.
  3. Find the letter h
    4.
  4. Find the letter b
    5.
  5. Find the letter o
    6.
  6. Find the letter m
    7.
  7. Find the letter n
    8.
  8. Find letter t
    9.