Understand any CS paper in 60 seconds — no login required
Hybrid search: keyword + semanticⓘ| Semantic-only search →
Try: LoRA fine-tuning·ZK-SNARKs·distributed consensus·Mamba SSM
All Features
Everything you need to explore, understand, and track CS research
Abstract Search
Paste any paper text to find semantically similar work instantly
Compare
Side-by-side diff of two papers — methods, results, claims
Explore
Browse the full indexed arXiv CS corpus
Authors
Researcher profiles, timelines and co-author graphs
Bookmarks
Save and organise papers for later reading
Claim Tracker
Type any claim — see which papers support or contradict it
Achievements
Start reading papers to earn your first badge
The Tournament Equilibrium Set Is PSPACE-Complete, Even under Hereditary Uniqueness
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 conditions.
Ethan Dickey, Athina Terzoglou
Sowing the Seeds of Intractability: Kalah is PSPACE-complete
The authors solve the complexity of the Kalah game on boards of growing size by showing it is PSPACE-complete.
Ethan Dickey, Ethan Mader
Computation with Backward Feedback: Power, Observation, and Cost
This paper studies the benefits and limitations of feedback in computation, specifically in the context of deterministic programs with random clock movements.