Sciweavers

2430 search results - page 34 / 486
» Computing Tutte Polynomials
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 9 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
CORR
2006
Springer
69views Education» more  CORR 2006»
13 years 9 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas