Sciweavers

78 search results - page 5 / 16
» Unsatisfiable Systems of Equations, Over a Finite Field
Sort
View
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Rational streams coalgebraically
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
Jan J. M. M. Rutten
APAL
2008
84views more  APAL 2008»
13 years 7 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
PRESENCE
2006
104views more  PRESENCE 2006»
13 years 7 months ago
Physically Realistic Virtual Surgery Using the Point-Associated Finite Field (PAFF) Approach
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
Suvranu De, Yi-Je Lim, Manivannan Muniyandi, Manda...
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 8 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
13 years 11 months ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev