Sciweavers

78 search results - page 2 / 16
» Unsatisfiable Systems of Equations, Over a Finite Field
Sort
View
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
13 years 7 months ago
Construction of Rational Points on Elliptic Curves over Finite Fields
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...
Andrew Shallue, Christiaan van de Woestijne

Publication
338views
12 years 3 months ago
A Reference Discretization Strategy for the Numerical Solution of Physical Field Problems.
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
13 years 5 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
FFA
2008
75views more  FFA 2008»
13 years 5 months ago
Syntactical and automatic properties of sets of polynomials over finite fields
Syntactical properties of representations of integers in various number systems are well-known and have been extensively studied. In this paper, we transpose the notion of recogniz...
Michel Rigo