Cobertura exata (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Cobertura exata" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

low place

580^th place

413^th place

69^th place

195^th place

arxiv.org

Richard M. Karp (1972). "Reducibility among combinatorial problems". In R.E. Miller and J.W. Thatcher (editors). Complexity of Computer Computations. Proc. of a Symp. on the Complexity of Computer Computations. New York: Plenum. pp. 85–103. ISBN 0-3063-0707-3.

^ M.R. Garey; D.S.Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman. ISBN 0-7167-1045-5.Esse livro é um classico, desenvolvimento da teoria, então cataloga muitos problemas NP-Completos.
Richard M. Karp (1972). "Reducibility among combinatorial problems". In R.E. Miller and J.W. Thatcher (editors). Complexity of Computer Computations. Proc. of a Symp. on the Complexity of Computer Computations. New York: Plenum. pp. 85–103. ISBN 0-3063-0707-3.
Donald Knuth in his paper "Dancing Links" gives this example, as equation (3), only with the rows reordered.