Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4007/annals.2015.181.2.1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4007/ANNALS.2015.181.2.1 / rank | |||
Normal rank | |||
Latest revision as of 17:09, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution |
scientific article |
Statements
Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (English)
0 references
9 February 2015
0 references
proof complexity
0 references
pseudorandom generators
0 references
0 references
0 references
0 references
