咨询与建议

限定检索结果

文献类型

  • 65 篇 期刊文献
  • 7 篇 会议

馆藏范围

  • 72 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 59 篇 理学
    • 59 篇 数学
  • 26 篇 工学
    • 24 篇 计算机科学与技术...
    • 7 篇 电气工程
    • 4 篇 电子科学与技术(可...
    • 2 篇 控制科学与工程
    • 1 篇 仪器科学与技术
    • 1 篇 信息与通信工程
    • 1 篇 软件工程
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 72 篇 computational nu...
  • 7 篇 elliptic curves
  • 6 篇 number theory
  • 4 篇 cryptography
  • 3 篇 primality testin...
  • 3 篇 inverse galois t...
  • 3 篇 public-key crypt...
  • 3 篇 amicable numbers
  • 3 篇 zeta functions
  • 3 篇 automorphic form...
  • 3 篇 diophantine equa...
  • 2 篇 diophantine equa...
  • 2 篇 modular forms
  • 2 篇 asymptotic estim...
  • 2 篇 spectral theory
  • 2 篇 research
  • 2 篇 fourier coeffici...
  • 2 篇 factoring proble...
  • 2 篇 rsa
  • 2 篇 factorization

机构

  • 2 篇 univ oklahoma sc...
  • 2 篇 china univ geosc...
  • 2 篇 uppsala univ dep...
  • 2 篇 princeton univ d...
  • 1 篇 loria f-54600 vi...
  • 1 篇 univ paderborn f...
  • 1 篇 univ rome tre di...
  • 1 篇 louisiana state ...
  • 1 篇 simon fraser uni...
  • 1 篇 swiss fed inst t...
  • 1 篇 univ luxembourg ...
  • 1 篇 faculteit exacte...
  • 1 篇 iota fdn d-10405...
  • 1 篇 univ bari dipart...
  • 1 篇 princeton univ d...
  • 1 篇 univ manitoba de...
  • 1 篇 interdisciplinar...
  • 1 篇 cnr ist matemat ...
  • 1 篇 korea natl univ ...
  • 1 篇 univ roma tre i-...

作者

  • 5 篇 yan sy
  • 2 篇 jackson th
  • 2 篇 page daniel r.
  • 2 篇 avelin helen
  • 2 篇 konig joachim
  • 2 篇 cheng qi
  • 2 篇 ren wei
  • 2 篇 suzuki k
  • 1 篇 burcsi peter
  • 1 篇 song yy
  • 1 篇 smart np
  • 1 篇 peralta r
  • 1 篇 scheidler renate
  • 1 篇 sakurai k
  • 1 篇 kristensen kai f...
  • 1 篇 klüners j
  • 1 篇 reingold o
  • 1 篇 d'atri gianfranc...
  • 1 篇 papanikolaou a
  • 1 篇 desmit b

语言

  • 61 篇 英文
  • 10 篇 其他
  • 1 篇 法文
检索条件"主题词=computational number theory"
72 条 记 录,以下是1-10 订阅
排序:
number theory - Probabilistic, heuristic, and computational approaches
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2002年 第8-9期43卷 1035-1061页
作者: Indlekofer, KH Univ Paderborn Fac Math & Informat D-33098 Paderborn Germany
After the description of the models of Kubilius, Novoselov and Schwarz, and Spilker, respectively, a probability theory for finitely additive probability measures is developed by use of the Stone-Cech compactification... 详细信息
来源: 评论
Progress towards a conjecture of SW Graham
收藏 引用
JOURNAL OF number theory 2025年 266卷 281-294页
作者: Nagaraj, S. V. Vellore Inst Technol Kelambakkam Vandalur Rd Chennai 600127 Tamil Nadu India
This article describes progress towards a conjecture of S.W. Graham. He conjectured that the number C-3(X) of Carmichael numbers up to X with three prime factors is = 1. He showed that his conjecture is true for X 10(... 详细信息
来源: 评论
Discrete-event diagnostic model for a distributed computational system. independent chains
收藏 引用
AUTOMATION AND REMOTE CONTROL 2016年 第10期77卷 1805-1817页
作者: Gruzlikov, A. M. Kolesov, N. V. Russian Federat Concern CSRI Elektropribor JSC State Res Ctr St Petersburg Russia ITMO Univ St Petersburg Russia
We consider synthesis problems for a discrete event model of a real time distributed computational system. The model reflects information exchange events between software units of the system and is intended to constru... 详细信息
来源: 评论
Prime number generation based on Pocklington's theorem
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2002年 第10期79卷 1049-1056页
作者: Papanikolaou, A Yan, SY Aston Univ Dept Comp Sci Birmingham B4 7ET W Midlands England
Public-key cryptosystems base their security on well-known number-theoretic problems, such as factorisation of a given number n . Hence, prime number generation is an absolute requirement. Many prime number generation... 详细信息
来源: 评论
Primality proving via one round in ECPP and one iteration in AKS
收藏 引用
JOURNAL OF CRYPTOLOGY 2007年 第3期20卷 375-387页
作者: Cheng, Qi Univ Oklahoma Sch Comp Sci Norman OK 73019 USA
In August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial-time primality-testing algorithm. For an input n, the Agarwal-Kayal-Saxena (AKS) algorithm runs in time Omicron (log(7.5) n) (... 详细信息
来源: 评论
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第30-32期410卷 2864-2869页
作者: Bugeaud, Yann Reutenauer, Christophe Siksek, Samir Univ Quebec Dept Math Montreal PQ H3C 3P8 Canada Univ Strasbourg UFR Math F-67084 Strasbourg France Univ Warwick Dept Math Coventry CV4 7AL W Midlands England
Sturmian sequences appear in the work of Markoff on approximations of real numbers and minima of quadratic functions. In particular, Christoffel words, or equivalently pairs of relatively prime nonnegative integers, p... 详细信息
来源: 评论
Mathematical analysis of some methods for amicable numbers
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1995年 第1-2期57卷 1-14页
作者: Song, YY [a] Department of Mathematics University of York England
In this paper, we present a mathematical analysis of some methods for generating amicable numbers, with an emphasis on proving the correctness of the methods and the correctness of the algorithms based on these methods.
来源: 评论
On the importance of cache tuning in a cache-aware algorithm:: A case study
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 2007年 第6期53卷 880-885页
作者: Burcsi, Peter Kovacs, Attila Eotvos Lorand Univ Dept Comp Algebra Budapest Hungary
In the present paper we describe and analyse a sieving algorithm for determining prime numbers. This external memory algorithm contains several parameters which are related to the sizes of the levels in the memory hie... 详细信息
来源: 评论
On the minimum gap between sums of square roots of small integers
收藏 引用
THEORETICAL COMPUTER SCIENCE 2011年 第39期412卷 5458-5465页
作者: Cheng, Qi Li, Yu-Hsin Univ Oklahoma Sch Comp Sci Norman OK 73019 USA
Let k and n be positive integers, n > k. Define r(n, k) to be the minimum positive value of vertical bar root a(1) + ... + root a(k) - root b(1) - ... - root bk vertical bar where a(1), a(2),, a(k), b(1), b(2), ..,... 详细信息
来源: 评论
Counting points on curves using a map to Pl, II
收藏 引用
FINITE FIELDS AND THEIR APPLICATIONS 2017年 45卷 301-322页
作者: Tuitman, Jan Katholieke Univ Leuven Dept Wiskunde Celestijnenlaan 200B B-3001 Leuven Belgium
We introduce a new algorithm to compute the zeta function of. a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all ... 详细信息
来源: 评论