Tardos function (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Tardos function" in English language version.

refsWebsite
Global rank English rank
451st place
277th place
2nd place
2nd place
332nd place
246th place
3rd place
3rd place
207th place
136th place
low place
low place

ams.org

mathscinet.ams.org

  • Tardos, É. (1988), "The gap between monotone and nonmonotone circuit complexity is exponential" (PDF), Combinatorica, 8 (1): 141–142, doi:10.1007/BF02122563, MR 0952004
  • Grötschel, M.; Lovász, L.; Schrijver, A. (1981), "The ellipsoid method and its consequences in combinatorial optimization", Combinatorica, 1 (2): 169–197, doi:10.1007/BF02579273, MR 0625550.
  • Razborov, A. A. (1985), "Lower bounds on the monotone complexity of some Boolean functions", Doklady Akademii Nauk SSSR, 281 (4): 798–801, MR 0785629
  • Alon, N.; Boppana, R. B. (1987), "The monotone circuit complexity of Boolean functions", Combinatorica, 7 (1): 1–22, CiteSeerX 10.1.1.300.9623, doi:10.1007/BF02579196, MR 0905147

books.google.com

cornell.edu

cs.cornell.edu

  • Tardos, É. (1988), "The gap between monotone and nonmonotone circuit complexity is exponential" (PDF), Combinatorica, 8 (1): 141–142, doi:10.1007/BF02122563, MR 0952004

doi.org

  • Tardos, É. (1988), "The gap between monotone and nonmonotone circuit complexity is exponential" (PDF), Combinatorica, 8 (1): 141–142, doi:10.1007/BF02122563, MR 0952004
  • Grötschel, M.; Lovász, L.; Schrijver, A. (1981), "The ellipsoid method and its consequences in combinatorial optimization", Combinatorica, 1 (2): 169–197, doi:10.1007/BF02579273, MR 0625550.
  • Alon, N.; Boppana, R. B. (1987), "The monotone circuit complexity of Boolean functions", Combinatorica, 7 (1): 1–22, CiteSeerX 10.1.1.300.9623, doi:10.1007/BF02579196, MR 0905147

lucatrevisan.wordpress.com

psu.edu

citeseerx.ist.psu.edu