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.

  • Quantum Adversary (Upper) Bound


    year of publication: 2011 arXiv

  • Super-Polynomial Quantum Speed-ups for Boolean Evaluation Trees with Hidden Structure


    year of publication: 2011 arXiv

  • Quantum invariant families of matrices in free probability


    year of publication: 2011 arXiv

    • Operator Algebras
    • Probability

    MSC 2010: 46L54 46L65 60G09

  • Operator system quotients of matrix algebras and their tensor products


    year of publication: 2011 arXiv

    • Operator Algebras
  • The effect of varying Fe-content on transport properties of K intercalated iron selenide KxFe2-ySe2


    year of publication: 2011 arXiv

    • Strongly Correlated Electrons
    • Superconductivity
  • Geometric group theory and arithmetic diameter


    year of publication: 2011 arXiv

    • Combinatorics
    • Group Theory
    • Metric Geometry
    • Number Theory

    MSC 2010: 05A17 11B05 11B13 11P99 20F65

  • The Random Quadratic Assignment Problem


    year of publication: 2011 arXiv

    • Combinatorics
    • Statistical Mechanics
  • On the Space of Trajectories of a Generic Vector Field


    year of publication: 2011 arXiv

    • Dynamical Systems
    • Geometric Topology

    MSC 2010: 57R20 58J52

  • On a linear programming approach to the discrete Willmore boundary value problem and generalizations


    year of publication: 2011 arXiv

    • Computational Geometry
    • Numerical Analysis
    • Optimization and Control
  • A harmonic analysis approach to essential normality of principal submodules


    year of publication: 2011 arXiv

    • Functional Analysis
    • Operator Algebras

    MSC 2010: 46E22 46H25 47A13 47A53

  1. 1
  2. ...
  3. 240
  4. ...
  5. 272