Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3
Work
Year: 2014
Type: article
Authors S. A. Lozhkin, V. A. Konovodov
Institution Moscow State University
Cites: 1
Cited by: 1
Related to: 10
FWCI:
Citation percentile (by year/subfield): 53.07
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed