External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Effective Lower Bounds for Complexity of Some Classes of Schemes

Alexander E. Andreev. Effective Lower Bounds for Complexity of Some Classes of Schemes. In Lothar Budach, Rais Gatic Bakharajev, Oleg Borisovic Lipanov, editors, Fundamentals of Computation Theory, International Conference FCT 87, Kazan, USSR, June 22-26, 1987, Proceedings. Volume 278 of Lecture Notes in Computer Science, pages 24-29, Springer, 1987.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on