Complexity measures and hierarchies for the evaluation of integers, polynomials, and N-linear forms

Richard J. Lipton; David Dobkin

doi:10.1145/800116.803746

Complexity measures and hierarchies for the evaluation of integers, polynomials, and N-linear forms

Richard J. Lipton
, David Dobkin

Research output: Contribution to journal › Conference article › peer-review

Original language	English (US)
Pages (from-to)	1-5
Number of pages	5
Journal	Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/800116.803746
State	Published - May 5 1975
Event	7th Annual ACM Symposium on Theory of Computing, STOC 1975 - Albuquerque, United States Duration: May 5 1975 → May 7 1975

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.1145/800116.803746

Cite this

@article{90ea732d774147b3934074d4353ce276,

title = "Complexity measures and hierarchies for the evaluation of integers, polynomials, and N-linear forms",

author = "Lipton, \{Richard J.\} and David Dobkin",

note = "Funding Information: The difference between our model and that of Strassen and Paterson and Stockmeyer is most dramatic when one compares the following results: \% The work of this author was supported in part by US Army grant DAHC04-75-6-0037. * The work of this author was supported in part by National Science Foundation grant GJ-43157.; 7th Annual ACM Symposium on Theory of Computing, STOC 1975 ; Conference date: 05-05-1975 Through 07-05-1975",

year = "1975",

month = may,

day = "5",

doi = "10.1145/800116.803746",

language = "English (US)",

pages = "1--5",

journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0737-8017",

publisher = "Association for Computing Machinery (ACM)",

}

TY - JOUR

T1 - Complexity measures and hierarchies for the evaluation of integers, polynomials, and N-linear forms

AU - Lipton, Richard J.

AU - Dobkin, David

N1 - Funding Information: The difference between our model and that of Strassen and Paterson and Stockmeyer is most dramatic when one compares the following results: % The work of this author was supported in part by US Army grant DAHC04-75-6-0037. * The work of this author was supported in part by National Science Foundation grant GJ-43157.

PY - 1975/5/5

Y1 - 1975/5/5

UR - https://www.scopus.com/pages/publications/85059193584

UR - https://www.scopus.com/pages/publications/85059193584#tab=citedBy

U2 - 10.1145/800116.803746

DO - 10.1145/800116.803746

M3 - Conference article

AN - SCOPUS:85059193584

SN - 0737-8017

SP - 1

EP - 5

JO - Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - 7th Annual ACM Symposium on Theory of Computing, STOC 1975

Y2 - 5 May 1975 through 7 May 1975

ER -

Complexity measures and hierarchies for the evaluation of integers, polynomials, and N-linear forms

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this