Work

Boolean Function Complexity: Advances and Frontiers

Year: 2012

Type: book

Source: Algorithms and combinatorics

DOI: 10.1007/978-3-642-24508-4

Author: Stasys Jukna

Institution: Goethe University Frankfurt

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

FWCI: 4.374

Cites: 159

Cited by: 397

Related to: 10