Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q600246 / rank | |||
| Property / author | |||
| Property / author: Leslie G. Valiant / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q90312317 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/174644.174647 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2142399242 / rank | |||
Normal rank | |||
Latest revision as of 22:01, 19 March 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
