Sciweavers

1695 search results - page 7 / 339
» Linear, Polynomial or Exponential
Sort
View
FOCS
2009
IEEE
14 years 5 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
TCS
2002
13 years 10 months ago
Notations for exponentiation
We define a coding of natural numbers
Arnold Beckmann
JACM
2000
119views more  JACM 2000»
13 years 10 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
14 years 2 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
FFA
2011
176views more  FFA 2011»
13 years 2 months ago
Exponential sums and polynomial congruences along p-adic submanifolds
In this article, we consider the estimation of exponential sums along the points of the reduction mod pm of a p-adic analytic submanifold of Zn p . More precisely, we extend Igusaâ...
Dirk Segers, W. A. Zuniga-Galindo