1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2026
SpeedrunBench: Challenging LLM Agents with Video Game Speedrunning
Yoshinari Fujinuma, Keisuke Kamahori, Ryuto Koike +8
Frontier LLM agents have been shown to be capable of solving increasingly complex tasks for which humans have measurable solutions. This begs the pertinent question of whether LLM…
math.CO2017★ 1 cited
Finding Minimum Spanning Forests in a Graph
Abdel-Rahman Madkour, Phillip Nadolny, Matthew Wright
We introduce a graph partitioning problem motivated by computational topology and propose two algorithms that produce approximate solutions. Specifically, given a weighted, undirec…