Work

The Exact Circuit Complexity of Boolean Functions in an Infinite Basis

Year: 2025

Type: article

Source: Mathematical Notes

DOI: 10.1134/s0001434625030241

Authors: V. V. Kochergin, A. V. Mikhailovich

Institutions: Lomonosov Moscow State University, National Research University Higher School of Economics

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

FWCI:

Cites: 10

Cited by:

Related to: 10