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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
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
17
click to vote
FOCS
2007
IEEE
83
views
Theoretical Computer Science
»
more
FOCS 2007
»
Derandomization of Sparse Cyclotomic Integer Zero Testing
14 years 1 months ago
Download
research.microsoft.com
Qi Cheng
claim paper
Read More »
22
click to vote
CORR
2010
Springer
138
views
Education
»
more
CORR 2010
»
Shallow Circuits with High-Powered Inputs
13 years 7 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 »