Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289): Difference between revisions
From MaRDI portal
Revision as of 16:00, 9 July 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