Brynmor Chapman

According to our database, Brynmor Chapman authored at least 7 papers between 2015 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

A Bookworm Climbs up the Polynomial Hierarchy: Meta-Restoration Complexity in Arithmetic Puzzles.

Brynmor Chapman, Lily Chung, Erik D. Demaine, Yota Irino, Della H. Hendrickson, Tonan Kamata, Ryuhei Uehara

Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2022

A Dual Perspective on Computational Complexity

Brynmor Chapman

PhD thesis, 2022

Smaller ACC0 Circuits for Symmetric Functions.

Brynmor Chapman, R. Ryan Williams

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Black-Box Hypotheses and Lower Bounds.

Brynmor Chapman, R. Ryan Williams

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2018

The Gotsman-Linial Conjecture is False.

Brynmor Chapman

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Effective Divergence Analysis for Linear Recurrence Sequences.

Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2015

The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data.

Brynmor Chapman, Ryan Williams

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015