咨询与建议

限定检索结果

文献类型

  • 3 篇 期刊文献
  • 2 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 4 篇 工学
    • 4 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 2 篇 理学
    • 2 篇 数学

主题

  • 5 篇 modular computat...
  • 1 篇 lll algorithm
  • 1 篇 fault injection
  • 1 篇 newton polytope
  • 1 篇 sieving
  • 1 篇 cuda
  • 1 篇 algebraic curves
  • 1 篇 symbolic algorit...
  • 1 篇 exponential diop...
  • 1 篇 security
  • 1 篇 parallel computi...
  • 1 篇 adjoint ideal
  • 1 篇 resultants
  • 1 篇 absolute factori...
  • 1 篇 gpu

机构

  • 1 篇 romanian acad si...
  • 1 篇 max planck inst ...
  • 1 篇 univ kaiserslaut...
  • 1 篇 univ turin dipar...
  • 1 篇 ecole natl super...
  • 1 篇 univ nice sophia...
  • 1 篇 univ buenos aire...
  • 1 篇 univ toulouse 3 ...

作者

  • 1 篇 cipu mihai
  • 1 篇 galligo andre
  • 1 篇 cheze guillaume
  • 1 篇 boehm janko
  • 1 篇 emeliyanenko pav...
  • 1 篇 bertone cristina
  • 1 篇 decker wolfram
  • 1 篇 laplagne santiag...
  • 1 篇 fieker claus
  • 1 篇 hoogvorst p
  • 1 篇 pfister gerhard
  • 1 篇 guilley s

语言

  • 5 篇 英文
检索条件"主题词=Modular computations"
5 条 记 录,以下是1-10 订阅
排序:
Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2013年 第11期73卷 1494-1505页
作者: Emeliyanenko, Pavel Max Planck Inst Informat D-66123 Saarbrucken Germany
In this article we report on our experience in computing resultants of bivariate polynomials on Graphics Processing Units (GPU). Following the outline of Collins' modular approach [6], our algorithm starts by mapp... 详细信息
来源: 评论
modular Las Vegas algorithms for polynomial absolute factorization
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2010年 第12期45卷 1280-1295页
作者: Bertone, Cristina Cheze, Guillaume Galligo, Andre Univ Nice Sophia Antipolis Lab JA Dieudonne Nice France Univ Turin Dipartimento Matemat I-10124 Turin Italy Univ Toulouse 3 Inst Math Toulouse F-31062 Toulouse France
Let f (X, Y) is an element of Z[X, Y] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope off, or more precisely, off modulo some prime inte... 详细信息
来源: 评论
Complete solution of the diophantine equation xy + yx = zz
收藏 引用
CZECHOSLOVAK MATHEMATICAL JOURNAL 2019年 第2期69卷 479-484页
作者: Cipu, Mihai Romanian Acad Simion Stoilow Inst Math Res Unit 5 POB 1-764 RO-014700 Bucharest Romania
The triples (x, y, z) = (1,z(z) - 1,z), (x, y, z) = (z(z) - 1,1,z), where z N, satisfy the equation x(y) + y(x) = z(z). In this paper it is shown that the same equation has no integer solution with min{x,y,z} > 1, ... 详细信息
来源: 评论
Bad Primes in Computational Algebraic Geometry
Bad Primes in Computational Algebraic Geometry
收藏 引用
5th International Congress on Mathematical Software (ICMS)
作者: Boehm, Janko Decker, Wolfram Fieker, Claus Laplagne, Santiago Pfister, Gerhard Univ Kaiserslautern D-67663 Kaiserslautern Germany Univ Buenos Aires Buenos Aires DF Argentina
computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the ... 详细信息
来源: 评论
The proof by 2M-1: A low-cost method to check arithmetic computations
The proof by 2M-1: A low-cost method to check arithmetic com...
收藏 引用
20th International Information Security Conference
作者: Guilley, S Hoogvorst, P Ecole Natl Super Telecommun Bretagne F-75634 Paris France
Injecting faults into an arithmetic device is a way of attacking cryptographic devices. The proof by 2(m-1) is a method to detect arithmetic errors induced by this attack without having to duplicate the computations. ... 详细信息
来源: 评论