On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern

Noam Nisan; Avi Wigderson

doi:10.1145/225058.225290

On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern

Noam Nisan, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.

Original language	English
Title of host publication	Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing
Place of Publication	New York, NY, USA
Publisher	Association for Computing Machinery
Pages	723–732
ISBN (Print)	0897917189
DOIs	https://doi.org/10.1145/225058.225290
State	Published - 1995
Event	27th annual ACM symposium on Theory of computing, STOC 1995 - Las Vegas, United States Duration: 29 May 1995 → 1 Jun 1995 Conference number: 27 https://dl.acm.org/doi/proceedings/10.1145/225058

Publication series

Name	STOC '95
Publisher	Association for Computing Machinery

Conference

Conference	27th annual ACM symposium on Theory of computing, STOC 1995
Abbreviated title	STOC '95
Country/Territory	United States
City	Las Vegas
Period	29/05/95 → 1/06/95
Internet address	https://dl.acm.org/doi/proceedings/10.1145/225058

Keywords

Theory of computation
Complexity classes

Access to Document

10.1145/225058.225290

https://doi.org/10.1145/225058.225290

Cite this

@inproceedings{1275e304a0364a568e14fcd95e533017,

title = "On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern",

abstract = "This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.",

keywords = "Theory of computation, Complexity classes",

author = "Noam Nisan and Avi Wigderson",

year = "1995",

doi = "10.1145/225058.225290",

language = "אנגלית",

isbn = "0897917189",

series = "STOC '95",

publisher = "Association for Computing Machinery",

pages = "723–732",

booktitle = "Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing",

note = "27th annual ACM symposium on Theory of computing, STOC 1995 ; Conference date: 29-05-1995 Through 01-06-1995",

url = "https://dl.acm.org/doi/proceedings/10.1145/225058",

}

Nisan, N & Wigderson, A 1995, On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern. in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing. STOC '95, Association for Computing Machinery, New York, NY, USA, pp. 723–732, 27th annual ACM symposium on Theory of computing, STOC 1995, Las Vegas, Nevada, United States, 29/05/95. https://doi.org/10.1145/225058.225290

On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern. / Nisan, Noam; Wigderson, Avi.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing. New York, NY, USA: Association for Computing Machinery, 1995. p. 723–732 (STOC '95).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On the Complexity of Bilinear Forms

T2 - 27th annual ACM symposium on Theory of computing, STOC 1995

AU - Nisan, Noam

AU - Wigderson, Avi

N1 - Conference code: 27

PY - 1995

Y1 - 1995

N2 - This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.

AB - This paper provides some new lower and upper bounds on computing bilinear forms by arithmetic circuits. The complexity measures considered are circuit size, formula size and time-space trade-offs.

KW - Theory of computation

KW - Complexity classes

U2 - 10.1145/225058.225290

DO - 10.1145/225058.225290

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

SN - 0897917189

T3 - STOC '95

SP - 723

EP - 732

BT - Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing

PB - Association for Computing Machinery

CY - New York, NY, USA

Y2 - 29 May 1995 through 1 June 1995

ER -

On the Complexity of Bilinear Forms: Dedicated to the Memory of Jacques Morgenstern

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this