External Links

Cite Key

Statistics

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

PDF

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.

Boolean Functions Whose Monotone Complexity is of Size n:::2:::/log n

Ingo Wegener. Boolean Functions Whose Monotone Complexity is of Size n:::2:::/log n. In Peter Deussen, editor, Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings. Volume 104 of Lecture Notes in Computer Science, pages 22-31, Springer, 1981.

Abstract

Abstract is missing.

runs on