1 – 4 of 4
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2021
-
Mark
Clique Is Hard on Average for Regular Resolution
(
- Contribution to journal › Article
- 2018
-
Mark
Clique is hard on average for regular resolution
2018) 50th Annual ACM Symposium on Theory of Computing, STOC 2018 In Proceedings of the Annual ACM Symposium on Theory of Computing p.646-659(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2016
-
Mark
Narrow proofs may be maximally long
(
- Contribution to journal › Article
- 2014
-
Mark
Narrow proofs may be maximally long
2014) 29th Annual IEEE Conference on Computational Complexity, CCC 2014 In Proceedings of the Annual IEEE Conference on Computational Complexity p.286-297(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding