Skip to main content
Article thumbnail
Location of Repository

Non-commutative circuits and the sum-of-squares problem

By Avi Wigderson and Amir Yehudayoff

Abstract

1.1. Non-commutative computation. Arithmetic complexity theory studies the computation of formal polynomials over some field or ring. Most of this theory is concerned with the computation of commutative polynomials. The basic model of computation is that of an arithmetic circuit. Despite decades of work, the bes

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.7463
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ams.org/journals/ja... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.