20 results for “PSPACE-complete”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
The authors prove that Puzznic is PSPACE-complete and improve the NP-completeness proof for a simpler version of the game, Cubic.
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.
This paper proves that the problem of deciding whether a given alternative belongs to the tournament equilibrium set (TEQ) is PSPACE-complete, and studies the complexity of the problem under different…
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…
The authors solve the complexity of the Kalah game on boards of growing size by showing it is PSPACE-complete.
The paper presents a direct construction of a doubly efficient interactive proof system for PSPACE decidable languages.
This paper presents algorithms to enumerate and find maximal enclosed vector subspaces in a given set of vectors over a finite field, with a quadratic speed-up compared to brute force.
The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.
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…
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.