The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity (Q5491249)
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: The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity |
scientific article; zbMATH DE number 5062016
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity |
scientific article; zbMATH DE number 5062016 |
Statements
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity (English)
0 references
10 October 2006
0 references
