Circuit satisfiability problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Circuit satisfiability problem" in English language version.

refsWebsite

Global rank English rank

2web.archive.org

1^st place

1^st place

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

low place

low place

580^th place

462^nd place

1scottaaronson.com

low place

low place

low place

low place

415^th place

327^th place

5^th place

5^th place

1minesweeper.info

low place

low place

low place

low place

berkeley.edu

cs.berkeley.edu

Luca Trevisan (November 29, 2001). "Notes for Lecture 23: NP-completeness of Circuit-SAT" (PDF). Archived from the original (PDF) on December 26, 2011. Retrieved February 4, 2012.

clarkson.edu

people.clarkson.edu

David Mix Barrington and Alexis Maciel (July 5, 2000). "Lecture 7: NP-Complete Problems" (PDF).

doi.org

Scott, Allan; Stege, Ulrike; van Rooij, Iris (2011-12-01). "Minesweeper May Not Be NP-Complete but Is Hard Nonetheless". The Mathematical Intelligencer. 33 (4): 5–17. doi:10.1007/s00283-011-9256-x. ISSN 1866-7414. S2CID 122506352.
Kaye, Richard (Mar 2000). "Minesweeper is NP-complete" (PDF). The Mathematical Intelligencer. 22 (2): 9–15. doi:10.1007/BF03025367. S2CID 122435790.

kfupm.edu.sa

reference.kfupm.edu.sa

Marques-Silva, João P. and Luís Guerra e Silva (1999). "Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning" (PDF). Archived from the original (PDF) on 2022-07-02.

minesweeper.info

Kaye, Richard (Mar 2000). "Minesweeper is NP-complete" (PDF). The Mathematical Intelligencer. 22 (2): 9–15. doi:10.1007/BF03025367. S2CID 122435790.

mit.edu

courses.csail.mit.edu

"Algorithmic Lower Bounds: Fun With Hardness Proofs at MIT" (PDF).

pdmi.ras.ru

Sergey Nurk (December 1, 2009). "An O(2^{0.4058m}) upper bound for Circuit SAT".

scottaaronson.com

See also, for example, the informal proof given in Scott Aaronson's lecture notes from his course Quantum Computing Since Democritus.

semanticscholar.org

api.semanticscholar.org

Scott, Allan; Stege, Ulrike; van Rooij, Iris (2011-12-01). "Minesweeper May Not Be NP-Complete but Is Hard Nonetheless". The Mathematical Intelligencer. 33 (4): 5–17. doi:10.1007/s00283-011-9256-x. ISSN 1866-7414. S2CID 122506352.
Kaye, Richard (Mar 2000). "Minesweeper is NP-complete" (PDF). The Mathematical Intelligencer. 22 (2): 9–15. doi:10.1007/BF03025367. S2CID 122435790.

web.archive.org

Luca Trevisan (November 29, 2001). "Notes for Lecture 23: NP-completeness of Circuit-SAT" (PDF). Archived from the original (PDF) on December 26, 2011. Retrieved February 4, 2012.
Marques-Silva, João P. and Luís Guerra e Silva (1999). "Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning" (PDF). Archived from the original (PDF) on 2022-07-02.

worldcat.org

search.worldcat.org

Scott, Allan; Stege, Ulrike; van Rooij, Iris (2011-12-01). "Minesweeper May Not Be NP-Complete but Is Hard Nonetheless". The Mathematical Intelligencer. 33 (4): 5–17. doi:10.1007/s00283-011-9256-x. ISSN 1866-7414. S2CID 122506352.