Sign In

Login

Password

Forgot Password ? Sign Up

Problème non élémentaire (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problème non élémentaire" in French language version.

refsWebsite
Global rank French rank
4doi.org
2nd place
3rd place
1springer.com
274th place
223rd place
1mit.edu
415th place
809th place
1ams.org
451st place
1,058th place
1arxiv.org
69th place
232nd place
1dagstuhl.de
low place
low place

ams.org

arxiv.org

dagstuhl.de

drops.dagstuhl.de

doi.org

dx.doi.org

  • Sergei Vorobyov et Andrie Voronkov, Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '98), New York, NY, USA, ACM, , 244–253 p. (ISBN 0-89791-996-3, DOI 10.1145/275487.275515), « Complexity of Nonrecursive Logic Programs with Complex Values ».
  • (en) Dietrich Kuske, « Theories of Automatic Structures and Their Complexity », dans Algebraic Informatics, Springer Berlin Heidelberg, (ISBN 9783642035630, DOI 10.1007/978-3-642-03564-7_5, lire en ligne), p. 81–98
  • (en) Leonid Libkin, « Logics for unranked trees : an overview », Logical Methods in Computer Science, vol. 2,‎ , p. 3:2, 31 (DOI 10.2168/LMCS-2(3:2)2006, MR 2295773, arXiv cs.LO/0606062).
  • (en) Sergei Vorobyov, Automated Deduction — Cade-13 : 13th International Conference on Automated Deduction New Brunswick, NJ, USA, July 30 – August 3, 1996, Proceedings, vol. 1104, Springer, coll. « Lecture Notes in Computer Science », , 275–287 p. (DOI 10.1007/3-540-61511-3_91), « An improved lower bound for the elementary theories of trees ».

mit.edu

people.csail.mit.edu

  • (en) Larry J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, Massachusetts Institute of Technology, coll. « Ph.D. dissertation », (lire en ligne).

springer.com

link.springer.com