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
24
click to vote
FOCS
1991
IEEE
favorite
Email
discuss
report
126
views
Theoretical Computer Science
»
more
FOCS 1991
»
Communication Complexity Towards Lower Bounds on Circuit Depth
14 years 1 days ago
Download
www.cse.yorku.ca
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
Jeff Edmonds, Steven Rudich, Russell Impagliazzo,
Real-time Traffic
Bit Boolean Functions
|
Circuit Depth Complexity
|
FOCS 1991
|
Theoretical Computer Science
|
claim paper
Related Content
»
Lower Bounds Using Kolmogorov Complexity
»
Lower Bounds on the Randomized Communication Complexity of ReadOnce Functions
»
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
»
Resistant Polynomials and Stronger Lower Bounds for DepthThree Arithmetical Formulas
»
Deterministic Restrictions in Circuit Complexity
»
Fast parallel circuits for the quantum Fourier transform
»
TradeOff Lower Bounds for Stack Machines
»
Cracks in the Defenses Scouting Out Approaches on Circuit Lower Bounds
»
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
more »
Post Info
More Details (n/a)
Added
27 Aug 2010
Updated
27 Aug 2010
Type
Conference
Year
1991
Where
FOCS
Authors
Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision