No. |
Title |
Author |
Year |
---|

1 |
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121) |
Gál, Anna et al. |
2019 |

2 |
Hardness Magnification near State-Of-The-Art Lower Bounds |
Oliveira, Igor Carboni et al. |
2019 |

3 |
Parity Helps to Compute Majority |
Oliveira, Igor Carboni et al. |
2019 |

4 |
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds |
Rajgopal, Ninad et al. |
2018 |

5 |
Expander-Based Cryptography Meets Natural Proofs |
Carboni Oliveira, Igor et al. |
2018 |

6 |
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits |
Hirahara, Shuichi et al. |
2018 |

7 |
Proof Complexity (Dagstuhl Seminar 18051) |
Atserias, Albert et al. |
2018 |

8 |
Pseudo-Derandomizing Learning and Approximation |
Carboni Oliveira, Igor et al. |
2018 |

9 |
Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness |
Oliveira, Igor C. Carboni et al. |
2017 |

10 |
On the Average-Case Complexity of MCSP and Its Variants |
Hirahara, Shuichi et al. |
2017 |