Sciweavers

78 search results - page 9 / 16
» Unsatisfiable Systems of Equations, Over a Finite Field
Sort
View
FROCOS
2000
Springer
13 years 11 months ago
Handling Differential Equations with Constraints for Decision Support
The behaviour of many systems is naturally modelled by a set of ordinary differential equations (ODEs) which are parametric. Since decisions are often based on relations over these...
Jorge Cruz, Pedro Barahona
JBI
2008
13 years 7 months ago
The Field Representation Language
The complexity of quantitative biomedical models, and the rate at which they are published, is increasing to a point where managing the information has become all but impossible w...
Guy Tsafnat
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
13 years 11 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
AAECC
1999
Springer
78views Algorithms» more  AAECC 1999»
13 years 7 months ago
Properties of Finite Response Input Sequences of Recursive Convolutional Codes
Abstract. A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response ...
Didier Le Ruyet, Hong Sun, Han Vu Thien