Boolean complexity classes vs. their arithmetic analogs (Q4894604)
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 932180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Boolean complexity classes vs. their arithmetic analogs |
scientific article; zbMATH DE number 932180 |
Statements
7 October 1996
0 references
Boolean classes \(NL\)
0 references
arithmetic analog
0 references
Boolean circuits
0 references
reductions
0 references
Boolean complexity classes vs. their arithmetic analogs (English)
0 references
0.9321041
0 references
0.91795284
0 references
0.90658104
0 references
0.9063399
0 references
0.90285224
0 references
0.9027915
0 references
