LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES.

^*Corresponding author for this work

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

371 Scopus citations

Original language	English
Title of host publication	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
Publisher	ACM (Order n 508830)
Pages	80-86
Number of pages	7
ISBN (Print)	0897910990, 9780897910996
DOIs	https://doi.org/10.1145/800061.808735
State	Published - 1983

Name	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0734-9025

Access to Document

@inproceedings{e0595e30331b493f9c6c0f7bfbe387da,

title = "LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES.",

author = "Michael Ben-Or",

year = "1983",

doi = "10.1145/800061.808735",

language = "אנגלית",

isbn = "0897910990",

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

publisher = "ACM (Order n 508830)",

pages = "80--86",

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

}

TY - GEN

T1 - LOWER BOUNDS FOR ALGEBRAIC COMPUTATION TREES.

AU - Ben-Or, Michael

PY - 1983

Y1 - 1983

UR - http://www.scopus.com/inward/record.url?scp=0020879158&partnerID=8YFLogxK

U2 - 10.1145/800061.808735

DO - 10.1145/800061.808735

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

AN - SCOPUS:0020879158

SN - 0897910990

SN - 9780897910996

T3 - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 80

EP - 86

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

PB - ACM (Order n 508830)

ER -