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
19
click to vote
ISCAS
1993
IEEE
favorite
Email
discuss
report
62
views
Hardware
»
more
ISCAS 1993
»
On the theoretical lower bound of the multiplicative complexity for DCT
14 years 20 days ago
Download
repository.lib.polyu.edu.hk
Yuk-Hee Chan, Wan-Chi Siu
Real-time Traffic
Hardware
|
ISCAS 1993
|
claim paper
Related Content
»
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
»
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
»
A NearTight Lower Bound on the Time Complexity of Distributed MST Construction
»
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
»
Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory
»
Lower Bounds for Dynamic Algebraic Problems
»
Circuit Complexity and Multiplicative Complexity of Boolean Functions
»
Communication Complexity Towards Lower Bounds on Circuit Depth
»
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
more »
Post Info
More Details (n/a)
Added
08 Aug 2010
Updated
08 Aug 2010
Type
Conference
Year
1993
Where
ISCAS
Authors
Yuk-Hee Chan, Wan-Chi Siu
Comments
(0)
Researcher Info
Hardware Study Group
Computer Vision