Sciweavers

1695 search results - page 7 / 339
» Linear, Polynomial or Exponential
Sort
View
91
Voted
FOCS
2009
IEEE
15 years 7 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
67
Voted
TCS
2002
15 years 8 days ago
Notations for exponentiation
We define a coding of natural numbers
Arnold Beckmann
JACM
2000
119views more  JACM 2000»
15 years 13 days 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»
15 years 4 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
99
Voted
FFA
2011
176views more  FFA 2011»
14 years 4 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