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
22
click to vote
STACS
2016
Springer
favorite
Email
discuss
report
47
views
Theoretical Computer Science
»
more
STACS 2016
»
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits
8 years 4 months ago
Download
drona.csa.iisc.ernet.in
We show an exponential separation between two well-studied models of algebraic computation, namely read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In particular we show the following:
Neeraj Kayal, Vineet Nair, Chandan Saha
Real-time Traffic
STACS 2016
|
Theoretical Computer Science
|
claim paper
Post Info
More Details (n/a)
Added
10 Apr 2016
Updated
10 Apr 2016
Type
Journal
Year
2016
Where
STACS
Authors
Neeraj Kayal, Vineet Nair, Chandan Saha
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision