20 results for “PSPACE-completeness”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
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 presents a direct construction of a doubly efficient interactive proof system for PSPACE decidable languages.
The authors prove that Puzznic is PSPACE-complete and improve the NP-completeness proof for a simpler version of the game, Cubic.
This paper studies the complexity of the bi-infinite Post Correspondence Problem with respect to the arithmetical hierarchy.
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 winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.
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.
This paper proves DP-completeness of Exact-3-DNP and Exact-4-DNP by reducing 3SAT to these problems.
The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.
This paper proves that the satisfiability problem of existential Presburger arithmetic extended with divisibility predicates (EPAD) is PP-hard.
Jiening Siow, Hanrui Zuo, Hanyun Jiang, Weiqi Wang +1 more
This paper studies and compares three strategies for solving shared-context batched satisfiability in program analyzers.
The authors extend the LOCAL model to unbounded degree graphs using Presburger monadic second-order (PMSO) formulas.
This paper proves that counting quasi-trees in a connected ribbon graph is #P-complete.
The authors prove that Conformability is NP-complete, settling the complexity of the problem.
This paper studies the wait-free solvability of approximate agreement among asynchronous processes with shared read-write registers.
This paper introduces classes of functions that compute the k-th solution for certain types of problems and proves their inter-reducibility with corresponding classes for different order functions. It…