Work

The Complexity of Boolean Functions

Year: 2005

Type: book-chapter

Source: Springer eBooks

Parent work: Complexity Theory

DOI: 10.1007/3-540-27477-4_16

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: W4206794571

FWCI: 33.67

Cites:

Cited by: 395

Related to: 10