Jayson Lynch
Jayson Lynch
Dirección de correo verificada de
Citado por
Citado por
A neural network solves, explains, and generates university math problems by program synthesis and few-shot learning at human level
I Drori, S Zhang, R Shuttleworth, L Tang, A Lu, E Ke, K Liu, L Chen, S Tran, ...
Proceedings of the National Academy of Sciences 119 (32), e2123433119, 2022
Computational complexity of motion planning of a robot through simple gadgets
ED Demaine, I Grosof, J Lynch, M Rudoy
arXiv preprint arXiv:1806.03539, 2018
Energy-efficient algorithms
ED Demaine, J Lynch, GJ Mirano, N Tyagi
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
Who needs crossings? Hardness of plane graph rigidity
Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl
32nd International Symposium on Computational Geometry (SoCG 2016), 2016
Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets
H Ani, J Bosboom, ED Demaine, J Diomidova, D Hendrickson, J Lynch
arXiv preprint arXiv:2006.01256, 2020
Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard
ED Demaine, DH Hendrickson, J Lynch
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
Tatamibari is NP-complete
A Adler, J Bosboom, ED Demaine, ML Demaine, QC Liu, J Lynch
arXiv preprint arXiv:2003.08331, 2020
Cache-adaptive analysis
MA Bender, ED Demaine, R Ebrahimi, JT Fineman, R Johnson, A Lincoln, ...
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
J Ani, ED Demaine, D Hendrickson, J Lynch
International Conference and Workshops on Algorithms and Computation, 187-198, 2022
Pushing blocks via checkable gadgets: PSPACE-completeness of Push-1F and Block/Box Dude
J Ani, L Chung, ED Demaine, Y Diomidov, D Hendrickson, J Lynch
11th International Conference on Fun with Algorithms (FUN 2022), 2022
The computational complexity of Portal and other 3D video games
ED Demaine, J Lockhart, J Lynch
arXiv preprint arXiv:1611.10319, 2016
Mario kart is hard
J Bosboom, ED Demaine, A Hesterberg, J Lynch, E Waingarten
Japanese Conference on Discrete and Computational Geometry and Graphs, 49-59, 2015
Fine-grained I/O complexity via reductions: New lower bounds, faster algorithms, and a time hierarchy
ED Demaine, A Lincoln, QC Liu, J Lynch, VV Williams
arXiv preprint arXiv:1711.07960, 2017
Cooperating in video games? impossible! undecidability of team multiplayer games
MJ Coulombe, J Lynch
Theoretical Computer Science 839, 30-40, 2020
PSPACE-completeness of pulling blocks to reach a goal
J Ani, S Asif, ED Demaine, Y Diomidov, D Hendrickson, J Lynch, ...
Journal of Information Processing 28, 929-941, 2020
Solving machine learning problems
S Tran, P Krishna, I Pakuwal, P Kafle, N Singh, J Lynch, I Drori
Asian conference on machine learning, 470-485, 2021
Yin-Yang puzzles are NP-complete
ED Demaine, J Lynch, M Rudoy, Y Uno
arXiv preprint arXiv:2106.15585, 2021
Characterizing universal reconfigurability of modular pivoting robots
HA Akitaya, ED Demaine, A Gonczi, DH Hendrickson, A Hesterberg, ...
arXiv preprint arXiv:2012.07556, 2020
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Z Abel, J Bosboom, M Coulombe, ED Demaine, L Hamilton, A Hesterberg, ...
Theoretical Computer Science 839, 41-102, 2020
Traversability, reconfiguration, and reachability in the gadget framework
J Ani, ED Demaine, Y Diomidov, D Hendrickson, J Lynch
Algorithmica 85 (11), 3453-3486, 2023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20