Work

A Criterion of Expressibility of CPL Functions in Generalized Bases

Year: 2025

Type: article

Source: Moscow University Mathematics Bulletin

DOI: 10.3103/s0027132225700354

Author: V. G. Shishlyakov

Institution: Lomonosov Moscow State University

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

FWCI:

Cites: 2

Cited by:

Related to: 10