The complexity of Boolean function implementation in some classes of automaton circuits (Q5947815)
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 complexity of Boolean function implementation in some classes of automaton circuits |
scientific article; zbMATH DE number 1666013
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of Boolean function implementation in some classes of automaton circuits |
scientific article; zbMATH DE number 1666013 |
Statements
The complexity of Boolean function implementation in some classes of automaton circuits (English)
0 references
28 October 2001
0 references
Boolean functions
0 references
automaton circuits
0 references
networks
0 references
complexity
0 references
0 references
0.91725326
0 references
0.9109185
0 references
