Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution |
scientific article; zbMATH DE number 6399441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution |
scientific article; zbMATH DE number 6399441 |
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
0 references
0.88688904
0 references
0.8848603
0 references
0.8820815
0 references
0.8601945
0 references
0.85934174
0 references
