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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
351
search results - page 71 / 71
»
Classical proof forestry
Sort
relevance
views
votes
recent
update
View
thumb
title
117
click to vote
STOC
2010
ACM
168
views
Algorithms
»
more
STOC 2010
»
Non-commutative circuits and the sum-of-squares problem
16 years 17 days ago
Download
eccc.hpi-web.de
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
claim paper
Read More »
« Prev
« First
page 71 / 71
Last »
Next »