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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
17
click to vote
FOCS
2006
IEEE
favorite
Email
discuss
report
83
views
Theoretical Computer Science
»
more
FOCS 2006
»
Lower bounds for circuits with MOD_m gates
14 years 2 months ago
Download
www.math.cas.cz
Arkadev Chattopadhyay, Navin Goyal, Pavel Pudl&aac
Real-time Traffic
FOCS 2006
|
Theoretical Computer Science
|
claim paper
Related Content
»
Nonuniform ACC Circuit Lower Bounds
»
Linear Systems over Composite Moduli
»
Learning and Lower Bounds for AC0 with Threshold Gates
»
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
»
Cosmological lower bound on the circuit complexity of a small problem in logic
»
Lower Bounds and Separations for Constant Depth Multilinear Circuits
»
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
»
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
»
Circuit Complexity and Multiplicative Complexity of Boolean Functions
more »
Post Info
More Details (n/a)
Added
11 Jun 2010
Updated
11 Jun 2010
Type
Conference
Year
2006
Where
FOCS
Authors
Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision