Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296)
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 598338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptographic limitations on learning Boolean formulae and finite automata |
scientific article; zbMATH DE number 598338 |
Statements
Cryptographic limitations on learning Boolean formulae and finite automata (English)
0 references
1 March 1995
0 references
probably approximately correct
0 references
public-key cryptosystems
0 references
strong intractability
0 references
0.8325021862983704
0 references
0.8229566812515259
0 references
0.8148206472396851
0 references
0.8148206472396851
0 references
0.8074422478675842
0 references
