Editing PSPACE-complete (section)

==References==
{{reflist|refs=

<ref name=arora-barak>{{citation
 | last1 = Arora | first1 = Sanjeev
 | last2 = Barak | first2 = Boaz
 | isbn = 978-1-139-47736-9
 | page = 92
 | publisher = Cambridge University Press
 | title = Computational Complexity: A Modern Approach
 | url = https://books.google.com/books?id=nGvI7cOuOOQC&pg=PA92
 | year = 2009}}</ref>

<ref name=berman-hartmanis>{{citation
 | last1 = Berman | first1 = L.
 | last2 = Hartmanis | first2 = J. | author2-link = Juris Hartmanis
 | doi = 10.1137/0206023
 | issue = 2
 | journal = [[SIAM Journal on Computing]]
 | mr = 455536
 | pages = 305–322
 | title = On isomorphisms and density of NP and other complete sets
 | volume = 6
 | year = 1977| hdl = 1813/7101
 | hdl-access = free
 }}</ref>

<ref name=boncer>{{citation
 | last1 = Bonsma | first1 = Paul
 | last2 = Cereceda | first2 = Luis
 | doi = 10.1016/j.tcs.2009.08.023 | doi-access = free
 | issue = 50
 | journal = Theoretical Computer Science
 | mr = 2573973
 | pages = 5215–5226
 | title = Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
 | volume = 410
 | year = 2009}}</ref>

<ref name=eppstein>{{citation
 | last = Eppstein | first = David | author-link = David Eppstein
 | title = Computational Complexity of Games and Puzzles
 | url = http://www.ics.uci.edu/~eppstein/cgt/hard.html}}</ref>

<ref name=garey-johnson>{{citation
 | last1 = Garey | first1 = Michael R. | author1-link = Michael R. Garey
 | last2 = Johnson | first2 = David S. | author2-link = David S. Johnson
 | contribution = Section 7.4: Polynomial Space Completeness
 | isbn = 0-7167-1045-5
 | pages = [https://archive.org/details/computersintract0000gare/page/170 170–177]
 | publisher = W.H. Freeman
 | title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]]
 | year = 1979}}</ref>

<ref name=hearn-demaine>{{citation
 | last1 = Hearn | first1 = Robert A. | author1-link = Bob Hearn
 | last2 = Demaine | first2 = Erik D. | author2-link = Erik Demaine
 | publisher = [[A K Peters]]
 | title = Games, Puzzles, and Computation
 | title-link = Games, Puzzles, and Computation
 | year = 2009}}</ref>

<ref name=hitchcock-pavan>{{citation
 | last1 = Hitchcock | first1 = John M.
 | last2 = Pavan | first2 = Aduri
 | editor1-last = Chatterjee | editor1-first = Krishnendu
 | editor2-last = Sgall | editor2-first = Jirí
 | contribution = Length-increasing reductions for PSPACE-completeness
 | doi = 10.1007/978-3-642-40313-2_48
 | mr = 3126236
 | pages = 540–550
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings
 | volume = 8087
 | year = 2013}}</ref>

<ref name=hunt>{{citation
 | last = Hunt | first = Harry B. III
 | editor1-last = Aho | editor1-first = Alfred V.
 | editor2-last = Borodin | editor2-first = Allan
 | editor3-last = Constable | editor3-first = Robert L.
 | editor4-last = Floyd | editor4-first = Robert W.
 | editor5-last = Harrison | editor5-first = Michael A.
 | editor6-last = Karp | editor6-first = Richard M.
 | editor7-last = Strong | editor7-first = H. Raymond
 | contribution = On the time and tape complexity of languages, I
 | doi = 10.1145/800125.804030
|doi-access=free
|url=https://dl.acm.org/doi/pdf/10.1145/800125.804030
 | hdl = 1813/6007
 | pages = 10–19
 | publisher = Association for Computing Machinery
 | title = Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA
 | year = 1973| s2cid = 15937339
 | hdl-access = free
|url-status=live |archive-url=https://web.archive.org/web/20240117051807/https://dl.acm.org/doi/pdf/10.1145/800125.804030 |archive-date= Jan 17, 2024 
 }}</ref>

<ref name=jkkpp>{{citation
 | last1 = Johnson | first1 = Matthew
 | last2 = Kratsch | first2 = Dieter
 | last3 = Kratsch | first3 = Stefan
 | last4 = Patel | first4 = Viresh
 | last5 = Paulusma | first5 = Daniël
 | doi = 10.1007/s00453-015-0009-7
 | issue = 2
 | journal = Algorithmica
 | mr = 3506195
 | pages = 295–321
 | title = Finding shortest paths between graph colourings
 | volume = 75
 | year = 2016| s2cid = 6810123
 | url = http://dro.dur.ac.uk/15595/1/15595.pdf
 }}</ref>

<ref name=kuroda>{{citation
 | last = Kuroda | first = S.-Y. | author-link = S.-Y. Kuroda
 | doi = 10.1016/s0019-9958(64)90120-2 | doi-access = free
 | journal = Information and Computation
 | mr = 0169724
 | pages = 207–223
 | title = Classes of languages and linear-bounded automata
 | volume = 7
 | year = 1964| issue = 2 }}</ref>

<ref name=watanabe-tang>{{citation
 | last1 = Watanabe | first1 = Osamu
 | last2 = Tang | first2 = Shou Wen
 | doi = 10.1016/0304-3975(92)90074-P
 | issue = 2
 | journal = Theoretical Computer Science
 | mr = 1163815
 | pages = 199–215
 | title = On polynomial-time Turing and many-one completeness in PSPACE
 | volume = 97
 | year = 1992| doi-access = free
 }}</ref>

}}