Complexity of automata computing values of functions given in the prefix form (Q5936690)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of automata computing values of functions given in the prefix form |
scientific article; zbMATH DE number 1614371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of automata computing values of functions given in the prefix form |
scientific article; zbMATH DE number 1614371 |
Statements
Complexity of automata computing values of functions given in the prefix form (English)
0 references
4 July 2001
0 references
The note deals with the problem of estimating the complexity of devices of automata for computing the values of formulas. The formulas are taken over the set of all Boolean functions of two-variables which do not contain imaginary variables and the negation function of one variable. All functions are assumed to be written in the prefix form.
0 references
complexity of devices
0 references
values of functions
0 references
0.8129194378852844
0 references
0.7381629943847656
0 references
0.7288201451301575
0 references
0.7248497009277344
0 references
0.7227774858474731
0 references
