Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
87
Voted
FOCS
2004
IEEE
83
views
Theoretical Computer Science
»
more
FOCS 2004
»
Testing Polynomials over General Fields
15 years 6 months ago
Download
www.eng.tau.ac.il
Tali Kaufman, Dana Ron
Real-time Traffic
FOCS 2004
|
Theoretical Computer Science
|
claim paper
Related Content
»
Testing LowDegree Polynomials over Prime Fields
»
Factoring Polynomials over Finite Fields using Balance Test
»
Irreducibility testing over local fields
»
Unsatisfiable Systems of Equations Over a Finite Field
»
Checking Polynomial Identities over any Field Towards a Derandomization
»
SelfTesting Polynomial Functions Efficiently and Over Rational Domains
»
Decomposing Algebraic Varieties
»
Distribution of irreducible polynomials of small degrees over finite fields
»
A General Polynomial Sieve
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2004
Where
FOCS
Authors
Tali Kaufman, Dana Ron
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision