For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
3
views
0
references
 Top references
cited by
39
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,887
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Conference Proceedings: not found

      Lower bounds for algebraic computation trees

      proceedings-article
      Author(s):
      Publication date (Print):
      Conference name: the fifteenth annual ACM symposium (STOC '83)
      Conference date: -

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Conference
          Publication date (Print): 1983
          Pages: 80-86
          Article
          DOI: 10.1145/800061.808735
          SO-VID: 6321d07c-8726-498c-9312-cc65a1920029
          Copyright © © 1983
          Conference name: the fifteenth annual ACM symposium
          Conference acronym: STOC '83
          Conference number: 15
          Conference location: Not Known
          Conference date: -
          Conference sponsor: SIGACT, ACM Special Interest Group on Algorithms and Computation Theory
          History

          Data availability:

          Comments

          Comment on this article