20 results for “PSPACE-complete”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.
This paper proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.
Chenyu Zhou, Xinyun Lu, Jiangyue Zhao, Jianghao Lin +2 more
The paper introduces OR-Space, a novel full-lifecycle workspace benchmark designed to rigorously evaluate industrial optimization agents by simulating real-world, multi-stage OR workflows that go beyo…
The authors prove that the solution-search problem for Ice Walk puzzle is ASP-complete by reducing Hamiltonian cycles in a maximum-degree-3 spanning subgraph of a rectangular grid graph to Ice Walk so…
The paper shows that every problem asking if a given graph has an edge-coloring without an edge-colored clique from a fixed family is poly-time equivalent to a Constraint Satisfaction Problem, resulti…
The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
Phoenix is a multi-agent system that uses seven safety controls and a test evaluation strategy to resolve GitHub issues, achieving 75% oracle-resolution with no regressions on a curated benchmark and…
This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.
This paper generalizes the Phoa principle in synthetic domain theory to transfinite cases, introduces sobriomorphisms, and proposes a hypothetical completeness theorem.
Shikun Liu, Mufei Li, Dongqi Fu, Haoyu Wang +4 more
Introduce Parallel-Synthesis, a framework enabling a synthesizer to directly consume parallel agent branches' KV caches, improving efficiency and performance.
Jun Zhang, JianYing Qu, Hanwen Du, Zhongkai Sun +2 more
The paper introduces Code-QA-Bench, a novel framework that rigorously separates genuine code reasoning from mere documentation memorization in repository-level code understanding benchmarks.
Jisen Li, Bingxuan Li, Nanyi Jiang, Xuying Ning +9 more
PaperPilot is an interactive literature search agent that constructs an executable DAG of paper-search operators based on user queries and feedback, improving search results and reducing errors.
The paper introduces a new structural merge tool that ensures parsability and universality in comparison to existing tools, resulting in fewer incorrect merge results.