Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q90312317, #quickstatements; #temporary_batch_1708557319324 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q90312317 / rank | |||
Normal rank | |||
Revision as of 01:47, 22 February 2024
scientific article; zbMATH DE number 598338
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
