Work

Models of Query Complexity for Boolean Functions

Year: 2010

Type: article

Author: Sourav Chakraborty

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2161307462

FWCI:

Cites: 47

Cited by:

Related to: 10