Add to ORKGIn this paper we define the parameterized integer relation construction algorithm PSLQ(tau), where the parameter tau can be freely chosen in a certain interval
49 pages.International audienceIn numerical linear algebra, a well-established practice is to choose...
International audienceWe study the complexity of computing one or several terms (not necessarily con...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
Abstract. Let K be either the real, complex, or quaternion number system and let O(K) be the corresp...
Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is s...
This is work in progress. Please let me know about any comments and suggestions. 1 What PSLQ is abou...
Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there...
We study the following problem: given x element Rn either find a short integer relation m element Zn...
AbstractGiven x ϵ Rn an integer relation for x is a non-trivial vector m ϵ Zn with inner product 〈m,...
We review polynomial time approaches for computing simultaneous integer relations among real numbers...
Given x small epsilon, Greek Rn an integer relation for x is a non-trivial vector m small epsilon, G...
Abstract. Let {x1,x2, ·· ·,xn} be a vector of real numbers. An integer relation algorithm is a compu...
Given x 2 R n an integer relation for x is a nontrivial vector m 2 Z n with inner product hm; xi...
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c ...
We call a vector x/spl isin/R/sup n/ highly regular if it satisfies =0 for some short, non-zero inte...
49 pages.International audienceIn numerical linear algebra, a well-established practice is to choose...
International audienceWe study the complexity of computing one or several terms (not necessarily con...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
Abstract. Let K be either the real, complex, or quaternion number system and let O(K) be the corresp...
Let x = (x{sub 1}, x{sub 2} {hor_ellipsis}, x{sub n}) be a vector of real or complex numbers. x is s...
This is work in progress. Please let me know about any comments and suggestions. 1 What PSLQ is abou...
Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there...
We study the following problem: given x element Rn either find a short integer relation m element Zn...
AbstractGiven x ϵ Rn an integer relation for x is a non-trivial vector m ϵ Zn with inner product 〈m,...
We review polynomial time approaches for computing simultaneous integer relations among real numbers...
Given x small epsilon, Greek Rn an integer relation for x is a non-trivial vector m small epsilon, G...
Abstract. Let {x1,x2, ·· ·,xn} be a vector of real numbers. An integer relation algorithm is a compu...
Given x 2 R n an integer relation for x is a nontrivial vector m 2 Z n with inner product hm; xi...
Let a be a vector of real numbers. By an integer relation for a we mean a non-zero integer vector c ...
We call a vector x/spl isin/R/sup n/ highly regular if it satisfies =0 for some short, non-zero inte...
49 pages.International audienceIn numerical linear algebra, a well-established practice is to choose...
International audienceWe study the complexity of computing one or several terms (not necessarily con...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...