What is Problem Mining? This is a tool based on data of arXiv.org which periodically scans packets of full texts of papers hosted on arXiv and available through arXiv's bulk data access policy, with the aim to automatically detect papers containing discussions on open problems or conjectures. It then creates a list from the detected papers putting together papers' descriptive data and some short snippets extracted from the full texts displaying an information on open problems or conjectures presented in the paper. The papers appearing on this list are only references to the arXiv's versions and we do NOT store the actual papers (TeX sources or PDFs) on our servers. To read any of the papers in this list one needs to follow the arXiv link displayed on the papers' blocks.

You can search within the list using keywords, author names, and subject area. By a simple click of the Interesting button, you may anonymously indicate your interest in the problem. If you think the automatic extraction resulted in incorrect data, you may click on the False positive button instead. The Stats section shows the worldwide interest by our users on a specific problem.

  • Greedy online colouring with buffering


    year of publication: 2016 arXiv

    • Discrete Mathematics

    MSC 2010: 05C15 05C85

  • SDDs are Exponentially More Succinct than OBDDs


    year of publication: 2016 arXiv

    • Logic in Computer Science
  • Asymptotic Intrinsic Universality and Reprogrammability by Behavioural Emulation


    year of publication: 2016 arXiv

    • Cellular Automata and Lattice Gases
    • Computational Complexity
    • Formal Languages and Automata Theory
  • Expansion of a simplicial complex


    year of publication: 2016 arXiv

    • Commutative Algebra

    MSC 2010: 13D02 13P10

  • Analytical solutions and genuine multipartite entanglement of the three-qubit Dicke model


    year of publication: 2016 arXiv

  • Topological equivalence of holomorphic foliation germs of rank $1$ with isolated singularity in the Poincaré domain


    year of publication: 2016 arXiv

    • Complex Variables

    MSC 2010: 32M25 32S65 37F75

  • Heavy Quark and Quarkonium Transport in High Energy Nuclear Collisions


    year of publication: 2016 arXiv

  • Abstract quotients of profinite groups, after Nikolov and Segal


    year of publication: 2016 arXiv

    • Group Theory

    MSC 2010: 20E18 20F12 22C05

  • On the Reducibility of Submodular Functions


    year of publication: 2016 arXiv

    • Machine Learning
  • On the Stanley depth of the path ideal of a cycle graph


    year of publication: 2016 arXiv

    • Commutative Algebra

    MSC 2010: 13C15 13F20 13P10

  1. 1
  2. ...
  3. 80
  4. ...
  5. 272