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
2
search results - page 1 / 1
»
Derandomization of Sparse Cyclotomic Integer Zero Testing
Sort
relevance
views
votes
recent
update
View
thumb
title
90
click to vote
FOCS
2007
IEEE
83
views
Theoretical Computer Science
»
more
FOCS 2007
»
Derandomization of Sparse Cyclotomic Integer Zero Testing
15 years 9 months ago
Download
research.microsoft.com
Qi Cheng
claim paper
Read More »
137
click to vote
CORR
2010
Springer
138
views
Education
»
more
CORR 2010
»
Shallow Circuits with High-Powered Inputs
15 years 3 months ago
Download
prunel.ccsd.cnrs.fr
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »