No. | Title | Author | Year |
---|---|---|---|
1 | Finding and Counting Patterns in Sparse Graphs | Komarath, Balagopal et al. | 2023 |
2 | Karchmer-Wigderson Games for Hazard-Free Computation | Ikenmeyer, Christian et al. | 2023 |
3 | Monotone Arithmetic Complexity of Graph Homomorphism Polynomials | Komarath, Balagopal et al. | 2022 |
4 | Rabbits Approximate, Cows Compute Exactly! | Komarath, Balagopal et al. | 2022 |
5 | Graph Pattern Polynomials | Bläser, Markus et al. | 2018 |
6 | Pebbling, Entropy and Branching Program Size Lower Bounds | Komarath, Balagopal et al. | 2013 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 6 |