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

1 |
Comparing Computational Entropies Below Majority (Or: When Is the Dense Model Theorem False?) |
Impagliazzo, Russell et al. |
2021 |

2 |
Lifting for Constant-Depth Circuits and Applications to MCSP |
Carmosino, Marco et al. |
2021 |

3 |
On the Power and Limitations of Branch and Cut |
Fleming, Noah et al. |
2021 |

4 |
On the Pseudo-Deterministic Query Complexity of NP Search Problems |
Goldwasser, Shafi et al. |
2021 |

5 |
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties |
An, Haozhe et al. |
2021 |

6 |
AC^0[p] Lower Bounds Against MCSP via the Coin Problem |
Golovnev, Alexander et al. |
2019 |

7 |
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity |
Carmosino, Marco L. et al. |
2018 |

8 |
Half-Duplex Communication Complexity |
Hoover, Kenneth et al. |
2018 |

9 |
Hardness Amplification for Non-Commutative Arithmetic Circuits |
Carmosino, Marco L. et al. |
2018 |

10 |
Stabbing Planes |
Beame, Paul et al. |
2018 |

11 |
The Power of Natural Properties as Oracles |
Impagliazzo, Russell et al. |
2018 |

12 |
Agnostic Learning from Tolerant Natural Proofs |
Carmosino, Marco L. et al. |
2017 |

13 |
Does Looking Inside a Circuit Help? |
Impagliazzo, Russell et al. |
2017 |

14 |
Learning Algorithms from Natural Proofs |
Carmosino, Marco L. et al. |
2016 |

15 |
Pseudorandomness When the Odds are Against You |
Artemenko, Sergei et al. |
2016 |

16 |
Tighter Connections between Derandomization and Circuit Lower Bounds |
Carmosino, Marco L. et al. |
2015 |

17 |
An Axiomatic Approach to Algebrization |
Impagliazzo, Russell et al. |
2010 |