Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 124 tok/s Pro
Kimi K2 200 tok/s Pro
GPT OSS 120B 463 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

A Critique of Czerwinski's "Separation of ${\rm PSPACE}$ and ${\rm EXP}$" (2304.14575v1)

Published 28 Apr 2023 in cs.CC

Abstract: Czerwinski's paper "Separation of ${\rm PSPACE}$ and ${\rm EXP}$" [Cze21] claims to prove that ${\rm PSPACE} \neq {\rm EXP}$ by showing there is no length-increasing polynomial-time reduction from a given ${\rm EXP}$-complete set to a given ${\rm PSPACE}$-complete set. However, in this critique, we show that there are fundamental flaws within the paper's approach and provide a counterexample to one of the paper's theorems, which makes the proposed proof that ${\rm PSPACE} \neq {\rm EXP}$ insufficient.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.