Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646)
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 1715687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions |
scientific article; zbMATH DE number 1715687 |
Statements
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (English)
0 references
3 March 2002
0 references
learning algorithm
0 references
random-self-reductions
0 references
coherent sets
0 references
0.8435556292533875
0 references
0.7940744161605835
0 references
0.7765374779701233
0 references
0.7765374779701233
0 references
