C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
A Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using Encoding Techniques.
Luke Friedman
Published in:
Electron. Colloquium Comput. Complex. (2013)
Keyphrases
</>
lower bound
main contribution
upper bound
worst case
computational complexity
np complete
decision problems