On read-once threshold formulae and their randomized decision tree complexity (Q1208407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166420
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On read-once threshold formulae and their randomized decision tree complexity |
scientific article; zbMATH DE number 166420 |
Statements
On read-once threshold formulae and their randomized decision tree complexity (English)
0 references
16 May 1993
0 references
lower bound
0 references
threshold circuits
0 references
decision trees
0 references
read-once \(TC^ 0\)
0 references
0 references
0.7955968976020813
0 references
0.7943652272224426
0 references
0.7917017340660095
0 references
0.7798413038253784
0 references
