PSPACE (Czech Wikipedia)

Analysis of information sources in references of the Wikipedia article "PSPACE" in Czech language version.

Last modified: 23:28:01, 11 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank Czech rank

6^th place

5^th place

49^th place

162^nd place

2^nd place

4^th place

15^th place

168^th place

14^th place

63^rd place

adsabs.harvard.edu (Global: 14^th place; Czech: 63^rd place)

Aaronson 2005. AARONSON, S., 2005. NP-complete problems and physical reality. SIGACT News. Březen 2005. doi:10.1145/1052796.1052804. S2CID 18759797. Bibcode 2005quant.ph..2072A. arXiv quant-ph/0502072.
Watrous a Aaronson 2009. WATROUS, John; AARONSON, Scott, 2009. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Roč. 465, čís. 2102, s. 631. doi:10.1098/rspa.2008.0350. S2CID 745646. Bibcode 2009RSPSA.465..631A. arXiv 0808.2669.

Sipser 1997, Section 8.2–8.3 (The Class PSPACE, PSPACE-completeness), pp. 281–294. SIPSER, Michael, 1997. Introduction to the Theory of Computation. [s.l.]: PWS Publishing. Dostupné online. ISBN 0-534-94728-X.
Sipser 2006, Chapter 8: Space Complexity. SIPSER, Michael, 2006. Introduction to the Theory of Computation. 2. vyd. [s.l.]: Thomson Course Technology. Dostupné online. ISBN 0-534-95097-3.
Papadimitriou 1993, Chapter 19: Polynomial space, pp. 455–490. PAPADIMITRIOU, Christos, 1993. Computational Complexity. 1. vyd. [s.l.]: Addison Wesley. Dostupné online. ISBN 0-201-53082-1.

QIP-PSPACE. Rahul Jain; Zhengfeng Ji; Sarvagya Upadhyay; John Watrous, 2009. QIP = PSPACE [online]. Červenec 2009. Dostupné online.
Aaronson 2005. AARONSON, S., 2005. NP-complete problems and physical reality. SIGACT News. Březen 2005. doi:10.1145/1052796.1052804. S2CID 18759797. Bibcode 2005quant.ph..2072A. arXiv quant-ph/0502072.
Watrous a Aaronson 2009. WATROUS, John; AARONSON, Scott, 2009. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Roč. 465, čís. 2102, s. 631. doi:10.1098/rspa.2008.0350. S2CID 745646. Bibcode 2009RSPSA.465..631A. arXiv 0808.2669.

Aaronson 2005. AARONSON, S., 2005. NP-complete problems and physical reality. SIGACT News. Březen 2005. doi:10.1145/1052796.1052804. S2CID 18759797. Bibcode 2005quant.ph..2072A. arXiv quant-ph/0502072.
Watrous a Aaronson 2009. WATROUS, John; AARONSON, Scott, 2009. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Roč. 465, čís. 2102, s. 631. doi:10.1098/rspa.2008.0350. S2CID 745646. Bibcode 2009RSPSA.465..631A. arXiv 0808.2669.

Aaronson 2005. AARONSON, S., 2005. NP-complete problems and physical reality. SIGACT News. Březen 2005. doi:10.1145/1052796.1052804. S2CID 18759797. Bibcode 2005quant.ph..2072A. arXiv quant-ph/0502072.
Watrous a Aaronson 2009. WATROUS, John; AARONSON, Scott, 2009. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Roč. 465, čís. 2102, s. 631. doi:10.1098/rspa.2008.0350. S2CID 745646. Bibcode 2009RSPSA.465..631A. arXiv 0808.2669.