On balanced versus unbalanced computation trees (Q4887490)
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 913012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On balanced versus unbalanced computation trees |
scientific article; zbMATH DE number 913012 |
Statements
On balanced versus unbalanced computation trees (English)
0 references
5 August 1996
0 references
leaf languages
0 references
nondeterministic polynomial-time machines
0 references
PP computations
0 references
0.8395874500274658
0 references
0.7740921378135681
0 references
0.7634392380714417
0 references
