Journal Article

A survey of Evasiveness : Lower Bounds on the Decision-Tree Complexity of Boolean Functions

  • Chronaki C
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Cite

CITATION STYLE

APA

Chronaki, C. E. (1990). A survey of Evasiveness : Lower Bounds on the Decision-Tree Complexity of Boolean Functions.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free