Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (Q2018028): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3615217 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5567889 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the synthesis and complexity of formulae with bounded depth of alternation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3604272 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finite state languages / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3103/s0027132214030036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979880130 / rank | |||
Normal rank | |||
Latest revision as of 10:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 |
scientific article |
Statements
Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3 (English)
0 references
24 March 2015
0 references
