:facetid:toc:\"db/journals/cc/cc23.bht\"OK:facetid:toc:db/journals/cc/cc23.bhtAnkit Gupta 0001Neeraj KayalYouming QiaoRandom arithmetic formulas can be reconstructed efficiently.Comput. Complex.232207-3032014Journal Articlesclosedjournals/cc/0001KQ1410.1007/S00037-014-0085-0https://doi.org/10.1007/s00037-014-0085-0https://dblp.org/rec/journals/cc/0001KQ14URL#3710965Andris AmbainisRonald de WolfHow Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?Comput. Complex.232305-3222014Journal Articlesclosedjournals/cc/AmbainisW1410.1007/S00037-014-0083-2https://doi.org/10.1007/s00037-014-0083-2https://dblp.org/rec/journals/cc/AmbainisW14URL#3710966Sergei ArtemenkoRonen ShaltielLower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification.Comput. Complex.23143-832014Journal Articlesclosedjournals/cc/ArtemenkoS1410.1007/S00037-012-0056-2https://doi.org/10.1007/s00037-012-0056-2https://dblp.org/rec/journals/cc/ArtemenkoS14URL#3710967Amos BeimelSebastian Ben DanielEyal KushilevitzEnav WeinrebChoosing, Agreeing, and Eliminating in Communication Complexity.Comput. Complex.2311-422014Journal Articlesclosedjournals/cc/BeimelDKW1410.1007/S00037-013-0075-7https://doi.org/10.1007/s00037-013-0075-7https://dblp.org/rec/journals/cc/BeimelDKW14URL#3710968Aleksandrs BelovsAnsis RosmanisOn the Power of Non-adaptive Learning Graphs.Comput. Complex.232323-3542014Journal Articlesclosedjournals/cc/BelovsR1410.1007/S00037-014-0084-1https://doi.org/10.1007/s00037-014-0084-1https://dblp.org/rec/journals/cc/BelovsR14URL#3710969Matei DavidPeriklis A. PapakonstantinouTradeoff lower lounds for stack machines.Comput. Complex.23199-1462014Journal Articlesclosedjournals/cc/DavidP1410.1007/S00037-012-0057-1https://doi.org/10.1007/s00037-012-0057-1https://dblp.org/rec/journals/cc/DavidP14URL#3710970Zeev DvirJános KollárShachar LovettVariety Evasive Sets.Comput. Complex.234509-5292014Journal Articlesclosedjournals/cc/DvirKL1410.1007/S00037-013-0073-9https://doi.org/10.1007/s00037-013-0073-9https://dblp.org/rec/journals/cc/DvirKL14URL#3710971Brady GarvinDerrick StoleeRaghunath TewariN. V. VinodchandranReachFewL = ReachUL.Comput. Complex.23185-982014Journal Articlesclosedjournals/cc/GarvinSTV1410.1007/S00037-012-0050-8https://doi.org/10.1007/s00037-012-0050-8https://dblp.org/rec/journals/cc/GarvinSTV14URL#3710972Daniel M. KaneThe correct exponent for the Gotsman-Linial Conjecture.Comput. Complex.232151-1752014Journal Articlesclosedjournals/cc/Kane1410.1007/S00037-014-0086-Zhttps://doi.org/10.1007/s00037-014-0086-zhttps://dblp.org/rec/journals/cc/Kane14URL#3710973Abhinav Kumar 0006Satyanarayana V. LokamVijay M. PatankarJayalal SarmaUsing Elimination Theory to Construct Rigid Matrices.Comput. Complex.234531-5632014Journal Articlesclosedjournals/cc/KumarLPS1410.1007/S00037-013-0061-0https://doi.org/10.1007/s00037-013-0061-0https://dblp.org/rec/journals/cc/KumarLPS14URL#3710974Alexis MacielPhuong NguyenToniann PitassiLifting lower bounds for tree-like proofs.Comput. Complex.234585-6362014Journal Articlesclosedjournals/cc/MacielNP1410.1007/S00037-013-0064-Xhttps://doi.org/10.1007/s00037-013-0064-xhttps://dblp.org/rec/journals/cc/MacielNP14URL#3710975Or MeirCombinatorial PCPs with Efficient Verifiers.Comput. Complex.233355-4782014Journal Articlesclosedjournals/cc/Meir1410.1007/S00037-014-0080-5https://doi.org/10.1007/s00037-014-0080-5https://dblp.org/rec/journals/cc/Meir14URL#3710976Martin MundhenkFelix WeissAn AC 1-complete model checking problem for intuitionistic logic.Comput. Complex.234637-6692014Journal Articlesclosedjournals/cc/MundhenkW1410.1007/S00037-013-0062-Zhttps://doi.org/10.1007/s00037-013-0062-zhttps://dblp.org/rec/journals/cc/MundhenkW14URL#3710977Rahul SanthanamRyan Williams 0001On Uniformity and Circuit Lower Bounds.Comput. Complex.232177-2052014Journal Articlesclosedjournals/cc/SanthanamW1410.1007/S00037-014-0087-Yhttps://doi.org/10.1007/s00037-014-0087-yhttps://dblp.org/rec/journals/cc/SanthanamW14URL#3710978Jason TeutschShort lists for shortest descriptions in short time.Comput. Complex.234565-5832014Journal Articlesclosedjournals/cc/Teutsch1410.1007/S00037-014-0090-3https://doi.org/10.1007/s00037-014-0090-3https://dblp.org/rec/journals/cc/Teutsch14URL#3710979Christopher UmansSpecial Issue "Conference on Computational Complexity 2013" Guest editor's foreword.Comput. Complex.232147-1492014Journal Articlesopenjournals/cc/Umans1410.1007/S00037-014-0088-Xhttps://doi.org/10.1007/s00037-014-0088-xhttps://dblp.org/rec/journals/cc/Umans14URL#3710980Emanuele ViolaRandomness Buys Depth for Approximate Counting.Comput. Complex.233479-5082014Journal Articlesclosedjournals/cc/Viola1410.1007/S00037-013-0076-6https://doi.org/10.1007/s00037-013-0076-6https://dblp.org/rec/journals/cc/Viola14URL#3710981