| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs | Buss, Sam et al. | 2020 |
| 2 | Reordering Rule Makes OBDD Proof Systems Stronger | Buss, Sam et al. | 2018 |
| 3 | On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables | Itsykson, Dmitry et al. | 2017 |
| 4 | Complexity of Distributions and Average-Case Hardness | Itsykson, Dmitry et al. | 2016 |
| 5 | On the Limits of Gate Elimination | Golovnev, Alexander et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |