Work

On the Complexity of Fanout-Bounded Parallel Prefix Circuits

Year: 2024

Type: article

Source: Journal of Applied and Industrial Mathematics

DOI: 10.1134/s1990478924040185

Author: I. S. Sergeev

Institution: Research Institute "Quantum"

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

FWCI:

Cites: 13

Cited by:

Related to: 10