Search dblp for Publications

export results for "toc:db/journals/toc/toc11.bht:"

 download as .bib file

@article{DBLP:journals/toc/AbbeM15,
  author       = {Emmanuel Abbe and
                  Andrea Montanari},
  title        = {Conditional Random Fields, Planted Constraint Satisfaction, and Entropy
                  Concentration},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {413--443},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a017},
  doi          = {10.4086/TOC.2015.V011A017},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AbbeM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AustrinMW15,
  author       = {Per Austrin and
                  Rajsekar Manokaran and
                  Cenny Wenner},
  title        = {On the NP-Hardness of Approximating Ordering-Constraint Satisfaction
                  Problems},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {257--283},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a010},
  doi          = {10.4086/TOC.2015.V011A010},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/AustrinMW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Barvinok15,
  author       = {Alexander I. Barvinok},
  title        = {Computing the Partition Function for Cliques in a Graph},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {339--355},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a013},
  doi          = {10.4086/TOC.2015.V011A013},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Barvinok15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BelovsB15,
  author       = {Aleksandrs Belovs and
                  Eric Blais},
  title        = {Quantum Algorithm for Monotonicity Testing on the Hypercube},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {403--412},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a016},
  doi          = {10.4086/TOC.2015.V011A016},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BelovsB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BrodyL15,
  author       = {Joshua Brody and
                  Kasper Green Larsen},
  title        = {Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data
                  Structures},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {471--489},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a019},
  doi          = {10.4086/TOC.2015.V011A019},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/BrodyL15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChildsGW15,
  author       = {Andrew M. Childs and
                  David Gosset and
                  Zak Webb},
  title        = {The Bose-Hubbard Model is QMA-complete},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {491--603},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a020},
  doi          = {10.4086/TOC.2015.V011A020},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/toc/ChildsGW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FabenJ15,
  author       = {John D. Faben and
                  Mark Jerrum},
  title        = {The Complexity of Parity Graph Homomorphism: An Initial Investigation},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {35--57},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a002},
  doi          = {10.4086/TOC.2015.V011A002},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/FabenJ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GharanT15,
  author       = {Shayan Oveis Gharan and
                  Luca Trevisan},
  title        = {A New Regularity Lemma and Faster Approximation Algorithms for Low
                  Threshold Rank Graphs},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {241--256},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a009},
  doi          = {10.4086/TOC.2015.V011A009},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GharanT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GlaubermanG15,
  author       = {George Glauberman and
                  Lukasz Grabowski},
  title        = {Groups with Identical k-Profiles},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {395--401},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a015},
  doi          = {10.4086/TOC.2015.V011A015},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GlaubermanG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GutoskiHMW15,
  author       = {Gus Gutoski and
                  Patrick M. Hayden and
                  Kevin Milner and
                  Mark M. Wilde},
  title        = {Quantum Interactive Proofs and the Complexity of Separability Testing},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {59--103},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a003},
  doi          = {10.4086/TOC.2015.V011A003},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/GutoskiHMW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HaramatyRS15,
  author       = {Elad Haramaty and
                  Noga Ron{-}Zewi and
                  Madhu Sudan},
  title        = {Absolutely Sound Testing of Lifted Codes},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {299--338},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a012},
  doi          = {10.4086/TOC.2015.V011A012},
  timestamp    = {Tue, 14 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/HaramatyRS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HrubesW15,
  author       = {Pavel Hrubes and
                  Avi Wigderson},
  title        = {Non-Commutative Arithmetic Circuits with Division},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {357--393},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a014},
  doi          = {10.4086/TOC.2015.V011A014},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/HrubesW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/JendrejOW15,
  author       = {Jacek Jendrej and
                  Krzysztof Oleszkiewicz and
                  Jakub Onufry Wojtaszczyk},
  title        = {On some extensions of the {FKN} theorem},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {445--469},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a018},
  doi          = {10.4086/TOC.2015.V011A018},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/JendrejOW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/KempeKT15,
  author       = {David Kempe and
                  Jon M. Kleinberg and
                  {\'{E}}va Tardos},
  title        = {Maximizing the Spread of Influence through a Social Network},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {105--147},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a004},
  doi          = {10.4086/TOC.2015.V011A004},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/KempeKT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Kopparty15,
  author       = {Swastik Kopparty},
  title        = {List-Decoding Multiplicity Codes},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {149--182},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a005},
  doi          = {10.4086/TOC.2015.V011A005},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Kopparty15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Kuperberg15,
  author       = {Greg Kuperberg},
  title        = {How Hard Is It to Approximate the Jones Polynomial?},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {183--219},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a006},
  doi          = {10.4086/TOC.2015.V011A006},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Kuperberg15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/LandsbergO15,
  author       = {Joseph M. Landsberg and
                  Giorgio Ottaviani},
  title        = {New Lower Bounds for the Border Rank of Matrix Multiplication},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {285--298},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a011},
  doi          = {10.4086/TOC.2015.V011A011},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/LandsbergO15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Moshkovitz15,
  author       = {Dana Moshkovitz},
  title        = {The Projection Games Conjecture and the NP-Hardness of ln n-Approximating
                  Set-Cover},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {221--235},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a007},
  doi          = {10.4086/TOC.2015.V011A007},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Moshkovitz15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/RaskhodnikovaS15,
  author       = {Sofya Raskhodnikova and
                  Ola Svensson},
  title        = {Special Issue: {APPROX-RANDOM} 2013: Guest Editors' Foreword},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {237--239},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a008},
  doi          = {10.4086/TOC.2015.V011A008},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/RaskhodnikovaS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Watson15,
  author       = {Thomas Watson},
  title        = {The Complexity of Deciding Statistical Properties of Samplable Distributions},
  journal      = {Theory Comput.},
  volume       = {11},
  pages        = {1--34},
  year         = {2015},
  url          = {https://doi.org/10.4086/toc.2015.v011a001},
  doi          = {10.4086/TOC.2015.V011A001},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/Watson15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics