Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4007/annals.2015.181.2.1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114400329 / rank | |||
Normal rank | |||
Revision as of 21:19, 19 March 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
