:facetid:toc:\"db/journals/toc/toc11.bht\"OK:facetid:toc:db/journals/toc/toc11.bhtEmmanuel AbbeAndrea MontanariConditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration.Theory Comput.11413-4432015Journal Articlesopenjournals/toc/AbbeM1510.4086/TOC.2015.V011A017https://doi.org/10.4086/toc.2015.v011a017https://dblp.org/rec/journals/toc/AbbeM15URL#3476331Per AustrinRajsekar ManokaranCenny WennerOn the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.Theory Comput.11257-2832015Journal Articlesopenjournals/toc/AustrinMW1510.4086/TOC.2015.V011A010https://doi.org/10.4086/toc.2015.v011a010https://dblp.org/rec/journals/toc/AustrinMW15URL#3476332Alexander I. BarvinokComputing the Partition Function for Cliques in a Graph.Theory Comput.11339-3552015Journal Articlesopenjournals/toc/Barvinok1510.4086/TOC.2015.V011A013https://doi.org/10.4086/toc.2015.v011a013https://dblp.org/rec/journals/toc/Barvinok15URL#3476333Aleksandrs BelovsEric BlaisQuantum Algorithm for Monotonicity Testing on the Hypercube.Theory Comput.11403-4122015Journal Articlesopenjournals/toc/BelovsB1510.4086/TOC.2015.V011A016https://doi.org/10.4086/toc.2015.v011a016https://dblp.org/rec/journals/toc/BelovsB15URL#3476334Joshua BrodyKasper Green LarsenAdapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures.Theory Comput.11471-4892015Journal Articlesopenjournals/toc/BrodyL1510.4086/TOC.2015.V011A019https://doi.org/10.4086/toc.2015.v011a019https://dblp.org/rec/journals/toc/BrodyL15URL#3476335Andrew M. ChildsDavid GossetZak WebbThe Bose-Hubbard Model is QMA-complete.Theory Comput.11491-6032015Journal Articlesopenjournals/toc/ChildsGW1510.4086/TOC.2015.V011A020https://doi.org/10.4086/toc.2015.v011a020https://dblp.org/rec/journals/toc/ChildsGW15URL#3476336John D. FabenMark JerrumThe Complexity of Parity Graph Homomorphism: An Initial Investigation.Theory Comput.1135-572015Journal Articlesopenjournals/toc/FabenJ1510.4086/TOC.2015.V011A002https://doi.org/10.4086/toc.2015.v011a002https://dblp.org/rec/journals/toc/FabenJ15URL#3476337Shayan Oveis GharanLuca TrevisanA New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs.Theory Comput.11241-2562015Journal Articlesopenjournals/toc/GharanT1510.4086/TOC.2015.V011A009https://doi.org/10.4086/toc.2015.v011a009https://dblp.org/rec/journals/toc/GharanT15URL#3476338George GlaubermanLukasz GrabowskiGroups with Identical k-Profiles.Theory Comput.11395-4012015Journal Articlesopenjournals/toc/GlaubermanG1510.4086/TOC.2015.V011A015https://doi.org/10.4086/toc.2015.v011a015https://dblp.org/rec/journals/toc/GlaubermanG15URL#3476339Gus GutoskiPatrick M. HaydenKevin MilnerMark M. WildeQuantum Interactive Proofs and the Complexity of Separability Testing.Theory Comput.1159-1032015Journal Articlesopenjournals/toc/GutoskiHMW1510.4086/TOC.2015.V011A003https://doi.org/10.4086/toc.2015.v011a003https://dblp.org/rec/journals/toc/GutoskiHMW15URL#3476340Elad HaramatyNoga Ron-ZewiMadhu Sudan 0001Absolutely Sound Testing of Lifted Codes.Theory Comput.11299-3382015Journal Articlesopenjournals/toc/HaramatyRS1510.4086/TOC.2015.V011A012https://doi.org/10.4086/toc.2015.v011a012https://dblp.org/rec/journals/toc/HaramatyRS15URL#3476341Pavel HrubesAvi WigdersonNon-Commutative Arithmetic Circuits with Division.Theory Comput.11357-3932015Journal Articlesopenjournals/toc/HrubesW1510.4086/TOC.2015.V011A014https://doi.org/10.4086/toc.2015.v011a014https://dblp.org/rec/journals/toc/HrubesW15URL#3476342Jacek JendrejKrzysztof OleszkiewiczJakub Onufry WojtaszczykOn some extensions of the FKN theorem.Theory Comput.11445-4692015Journal Articlesopenjournals/toc/JendrejOW1510.4086/TOC.2015.V011A018https://doi.org/10.4086/toc.2015.v011a018https://dblp.org/rec/journals/toc/JendrejOW15URL#3476343David Kempe 0001Jon M. KleinbergÉva TardosMaximizing the Spread of Influence through a Social Network.Theory Comput.11105-1472015Journal Articlesopenjournals/toc/KempeKT1510.4086/TOC.2015.V011A004https://doi.org/10.4086/toc.2015.v011a004https://dblp.org/rec/journals/toc/KempeKT15URL#3476344Swastik KoppartyList-Decoding Multiplicity Codes.Theory Comput.11149-1822015Journal Articlesopenjournals/toc/Kopparty1510.4086/TOC.2015.V011A005https://doi.org/10.4086/toc.2015.v011a005https://dblp.org/rec/journals/toc/Kopparty15URL#3476345Greg KuperbergHow Hard Is It to Approximate the Jones Polynomial?Theory Comput.11183-2192015Journal Articlesopenjournals/toc/Kuperberg1510.4086/TOC.2015.V011A006https://doi.org/10.4086/toc.2015.v011a006https://dblp.org/rec/journals/toc/Kuperberg15URL#3476346Joseph M. LandsbergGiorgio OttavianiNew Lower Bounds for the Border Rank of Matrix Multiplication.Theory Comput.11285-2982015Journal Articlesopenjournals/toc/LandsbergO1510.4086/TOC.2015.V011A011https://doi.org/10.4086/toc.2015.v011a011https://dblp.org/rec/journals/toc/LandsbergO15URL#3476347Dana MoshkovitzThe Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover.Theory Comput.11221-2352015Journal Articlesopenjournals/toc/Moshkovitz1510.4086/TOC.2015.V011A007https://doi.org/10.4086/toc.2015.v011a007https://dblp.org/rec/journals/toc/Moshkovitz15URL#3476349Sofya RaskhodnikovaOla SvenssonSpecial Issue: APPROX-RANDOM 2013: Guest Editors' Foreword.Theory Comput.11237-2392015Journal Articlesopenjournals/toc/RaskhodnikovaS1510.4086/TOC.2015.V011A008https://doi.org/10.4086/toc.2015.v011a008https://dblp.org/rec/journals/toc/RaskhodnikovaS15URL#3476350Thomas Watson 0001The Complexity of Deciding Statistical Properties of Samplable Distributions.Theory Comput.111-342015Journal Articlesopenjournals/toc/Watson1510.4086/TOC.2015.V011A001https://doi.org/10.4086/toc.2015.v011a001https://dblp.org/rec/journals/toc/Watson15URL#3476351