default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/cc:"
download as .bib file
@article{DBLP:journals/cc/AvrahamY24,
author = {Daniel Avraham and
Amir Yehudayoff},
title = {On Blocky Ranks Of Matrices},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {2},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00248-1},
doi = {10.1007/S00037-024-00248-1},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AvrahamY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BencsHR24,
author = {Ferenc Bencs and
Jeroen Huijben and
Guus Regts},
title = {Approximating the chromatic polynomial is as hard as computing it
exactly},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {1},
year = {2024},
url = {https://doi.org/10.1007/s00037-023-00247-8},
doi = {10.1007/S00037-023-00247-8},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BencsHR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChatterjeeKV24,
author = {Abhranil Chatterjee and
Mrinal Kumar and
Ben Lee Volk},
title = {Determinants vs. Algebraic Branching Programs},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {11},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00258-z},
doi = {10.1007/S00037-024-00258-Z},
timestamp = {Mon, 09 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChatterjeeKV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Chen24,
author = {Hubie Chen},
title = {Algebraic Global Gadgetry for Surjective Constraint Satisfaction},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {7},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00253-4},
doi = {10.1007/S00037-024-00253-4},
timestamp = {Mon, 10 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Chen24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DuttaST24,
author = {Pranjal Dutta and
Nitin Saxena and
Thomas Thierauf},
title = {Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply
{VP} {\(\not =\)}q {VNP}},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {3},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00249-0},
doi = {10.1007/S00037-024-00249-0},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DuttaST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FilmusIKK24,
author = {Yuval Filmus and
Yuval Ishai and
Avi Kaplan and
Guy Kindler},
title = {Limits of Preprocessing},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {5},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00251-6},
doi = {10.1007/S00037-024-00251-6},
timestamp = {Mon, 10 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/FilmusIKK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Guo24,
author = {Zeyu Guo},
title = {Variety Evasive Subspace Families},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {10},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00256-1},
doi = {10.1007/S00037-024-00256-1},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Guo24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kluge24,
author = {Laurence Kluge},
title = {Combinatorial refinement on circulant graphs},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {9},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00255-2},
doi = {10.1007/S00037-024-00255-2},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kluge24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Pich24,
author = {J{\'{a}}n Pich},
title = {Localizability of the approximation method},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {12},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00257-0},
doi = {10.1007/S00037-024-00257-0},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Pich24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RadaCS24,
author = {Miroslav Rada and
Michal Cern{\'{y}} and
Ondrej Sokol},
title = {The NP-hard problem of computing the maximal sample variance over
interval data is solvable in almost linear time with a high probability},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {8},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00254-3},
doi = {10.1007/S00037-024-00254-3},
timestamp = {Mon, 15 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RadaCS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RezendeMNPR24,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere},
title = {{KRW} Composition Theorems via Lifting},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {4},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00250-7},
doi = {10.1007/S00037-024-00250-7},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RezendeMNPR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SchederS24,
author = {Dominik Scheder and
John P. Steinberger},
title = {{PPSZ} for General k-SAT and {CSP} - Making Hertli's Analysis Simpler
and 3-SAT Faster},
journal = {Comput. Complex.},
volume = {33},
number = {2},
pages = {13},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00259-y},
doi = {10.1007/S00037-024-00259-Y},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SchederS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SingerSV24,
author = {Noah G. Singer and
Madhu Sudan and
Santhoshini Velusamy},
title = {Streaming approximation resistance of every ordering {CSP}},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {6},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00252-5},
doi = {10.1007/S00037-024-00252-5},
timestamp = {Mon, 09 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SingerSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Batra0S23,
author = {Rishabh Batra and
Nitin Saxena and
Devansh Shringi},
title = {Explicit construction of q+1 regular local Ramanujan graphs, for all
prime-powers q},
journal = {Comput. Complex.},
volume = {32},
number = {1},
pages = {2},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00235-y},
doi = {10.1007/S00037-023-00235-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Batra0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BonacinaGL23,
author = {Ilario Bonacina and
Nicola Galesi and
Massimo Lauria},
title = {On vanishing sums of roots of unity in polynomial calculus and sum-of-squares},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {12},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00242-z},
doi = {10.1007/S00037-023-00242-Z},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BonacinaGL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BournezD23,
author = {Olivier Bournez and
Arnaud Durand},
title = {A Characterization of Functions over the Integers Computable in Polynomial
Time Using Discrete Ordinary Differential Equations},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {7},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00240-1},
doi = {10.1007/S00037-023-00240-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BournezD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiFGK23,
author = {Jin{-}Yi Cai and
Zhiguo Fu and
Kurt Girstmair and
Michael Kowalczyk},
title = {A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using
Number Theory},
journal = {Comput. Complex.},
volume = {32},
number = {1},
pages = {4},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00237-w},
doi = {10.1007/S00037-023-00237-W},
timestamp = {Mon, 05 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CaiFGK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChauguleKLMSS23,
author = {Prasad Chaugule and
Mrinal Kumar and
Nutan Limaye and
Chandra Kanta Mohapatra and
Adrian She and
Srikanth Srinivasan},
title = {Schur Polynomials Do Not Have Small Formulas If the Determinant does
not},
journal = {Comput. Complex.},
volume = {32},
number = {1},
pages = {3},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00236-x},
doi = {10.1007/S00037-023-00236-X},
timestamp = {Mon, 05 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChauguleKLMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FindGHK23,
author = {Magnus Gausdal Find and
Alexander Golovnev and
Edward A. Hirsch and
Alexander S. Kulikov},
title = {Improving 3N Circuit Complexity Lower Bounds},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {13},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00246-9},
doi = {10.1007/S00037-023-00246-9},
timestamp = {Wed, 03 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FindGHK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GhoshalK23,
author = {Ashrujit Ghoshal and
Ilan Komargodski},
title = {On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damg{\aa}rd
Hashing},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {9},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00243-y},
doi = {10.1007/S00037-023-00243-Y},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GhoshalK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichR23,
author = {Oded Goldreich and
Dana Ron},
title = {A Lower Bound on the Complexity of Testing Grained Distributions},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {11},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00245-w},
doi = {10.1007/S00037-023-00245-W},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoKV23,
author = {Russell Impagliazzo and
Valentine Kabanets and
Ilya Volkovich},
title = {The Power of Natural Properties as Oracles},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {6},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00241-0},
doi = {10.1007/S00037-023-00241-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KaminskiSW23,
author = {Michael Kaminski and
Igor E. Shparlinski and
Michel Waldschmidt},
title = {On sets of linear forms of maximal complexity},
journal = {Comput. Complex.},
volume = {32},
number = {1},
pages = {1},
year = {2023},
url = {https://doi.org/10.1007/s00037-022-00234-5},
doi = {10.1007/S00037-022-00234-5},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KaminskiSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoiranS23,
author = {Pascal Koiran and
Subhayan Saha},
title = {Absolute reconstruction for sums of powers of linear forms: degree
3 and beyond},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {8},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00239-8},
doi = {10.1007/S00037-023-00239-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KoiranS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MattesW23,
author = {Caroline Mattes and
Armin Wei{\ss}},
title = {Parallel algorithms for power circuits and the word problem of the
Baumslag group},
journal = {Comput. Complex.},
volume = {32},
number = {2},
pages = {10},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00244-x},
doi = {10.1007/S00037-023-00244-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MattesW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shaltiel23,
author = {Ronen Shaltiel},
title = {Is it possible to improve Yao's {XOR} lemma using reductions that
exploit the efficiency of their oracle?},
journal = {Comput. Complex.},
volume = {32},
number = {1},
pages = {5},
year = {2023},
url = {https://doi.org/10.1007/s00037-023-00238-9},
doi = {10.1007/S00037-023-00238-9},
timestamp = {Mon, 05 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Shaltiel23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BhargavaG22,
author = {Vishwas Bhargava and
Sumanta Ghosh},
title = {Improved Hitting Set for Orbit of ROABPs},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {15},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00230-9},
doi = {10.1007/S00037-022-00230-9},
timestamp = {Fri, 11 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BhargavaG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BhattacharyaCGM22,
author = {Anup Bhattacharya and
Sourav Chakraborty and
Arijit Ghosh and
Gopinath Mishra and
Manaswi Paraashar},
title = {Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity
and Beyond},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {9},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00225-6},
doi = {10.1007/S00037-022-00225-6},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BhattacharyaCGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaselFFGL22,
author = {Katrin Casel and
Philipp Fischbeck and
Tobias Friedrich and
Andreas G{\"{o}}bel and
J. A. Gregor Lagodzinski},
title = {Zeros and approximations of Holant polynomials on the complex plane},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {11},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00226-5},
doi = {10.1007/S00037-022-00226-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CaselFFGL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChatterjeeKSV22,
author = {Prerona Chatterjee and
Mrinal Kumar and
Adrian She and
Ben Lee Volk},
title = {Quadratic Lower Bounds for Algebraic Branching Programs and Formulas},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {8},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00223-8},
doi = {10.1007/S00037-022-00223-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChatterjeeKSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ConnerGLV22,
author = {Austin Conner and
Fulvio Gesmundo and
Joseph M. Landsberg and
Emanuele Ventura},
title = {Rank and border rank of Kronecker powers of tensors and Strassen's
laser method},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {1},
year = {2022},
url = {https://doi.org/10.1007/s00037-021-00217-y},
doi = {10.1007/S00037-021-00217-Y},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ConnerGLV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DoronTT22,
author = {Dean Doron and
Amnon Ta{-}Shma and
Roei Tell},
title = {On Hitting-Set Generators for Polynomials that Vanish Rarely},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {16},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00229-2},
doi = {10.1007/S00037-022-00229-2},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DoronTT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GalanisGH22,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Andr{\'{e}}s Herrera{-}Poyatos},
title = {The complexity of approximating the complex-valued Potts model},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {2},
year = {2022},
url = {https://doi.org/10.1007/s00037-021-00218-x},
doi = {10.1007/S00037-021-00218-X},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GalanisGH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GharibianSSSY22,
author = {Sevag Gharibian and
Miklos Santha and
Jamie Sikora and
Aarthi Sundaram and
Justin Yirka},
title = {Quantum generalizations of the polynomial hierarchy with applications
to {QMA(2)}},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {13},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00231-8},
doi = {10.1007/S00037-022-00231-8},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GharibianSSSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GirishRT22,
author = {Uma Girish and
Ran Raz and
Avishay Tal},
title = {Quantum versus Randomized Communication Complexity, with Efficient
Players},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {17},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00232-7},
doi = {10.1007/S00037-022-00232-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GirishRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Goldreich22,
author = {Oded Goldreich},
title = {Improved bounds on the AN-complexity of O(1)-linear functions},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {7},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00224-7},
doi = {10.1007/S00037-022-00224-7},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Goldreich22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GorlachRZ22,
author = {Paul G{\"{o}}rlach and
Yue Ren and
Leon Zhang},
title = {Computing zero-dimensional tropical varieties via projections},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {5},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00222-9},
doi = {10.1007/S00037-022-00222-9},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GorlachRZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Haviv22,
author = {Ishay Haviv},
title = {The Complexity of Finding Fair Independent Sets in Cycles},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {14},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00233-6},
doi = {10.1007/S00037-022-00233-6},
timestamp = {Fri, 11 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Haviv22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HiraiI22,
author = {Hiroshi Hirai and
Motoki Ikeda},
title = {A cost-scaling algorithm for computing the degree of determinants},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {10},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00227-4},
doi = {10.1007/S00037-022-00227-4},
timestamp = {Thu, 05 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HiraiI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KumarV22,
author = {Mrinal Kumar and
Ben Lee Volk},
title = {A Lower Bound on Determinantal Complexity},
journal = {Comput. Complex.},
volume = {31},
number = {2},
pages = {12},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00228-3},
doi = {10.1007/S00037-022-00228-3},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KumarV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/OliveiraST22,
author = {Igor C. Oliveira and
Rahul Santhanam and
Roei Tell},
title = {Expander-Based Cryptography Meets Natural Proofs},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {4},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00220-x},
doi = {10.1007/S00037-022-00220-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/OliveiraST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PoteauxW22,
author = {Adrien Poteaux and
Martin Weimann},
title = {A quasi-linear irreducibility test in {\unicode{54594}}[[x]][y]},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {6},
year = {2022},
url = {https://doi.org/10.1007/s00037-022-00221-w},
doi = {10.1007/S00037-022-00221-W},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PoteauxW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watson22,
author = {Thomas Watson},
title = {Amplification with One {NP} Oracle Query},
journal = {Comput. Complex.},
volume = {31},
number = {1},
pages = {3},
year = {2022},
url = {https://doi.org/10.1007/s00037-021-00219-w},
doi = {10.1007/S00037-021-00219-W},
timestamp = {Wed, 16 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Watson22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BishtS21,
author = {Pranav Bisht and
Nitin Saxena},
title = {Blackbox identity testing for sum of special ROABPs and its border
class},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {8},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00209-y},
doi = {10.1007/S00037-021-00209-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BishtS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FijalkowLOS21,
author = {Nathana{\"{e}}l Fijalkow and
Guillaume Lagarde and
Pierre Ohlmann and
Olivier Serre},
title = {Lower Bounds for Arithmetic Circuits via the Hankel Matrix},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {14},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00214-1},
doi = {10.1007/S00037-021-00214-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FijalkowLOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GiesbrechtJS21,
author = {Mark Giesbrecht and
Armin Jamshidpey and
{\'{E}}ric Schost},
title = {Subquadratic-Time Algorithms for Normal Bases},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {5},
year = {2021},
url = {https://doi.org/10.1007/s00037-020-00204-9},
doi = {10.1007/S00037-020-00204-9},
timestamp = {Wed, 17 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GiesbrechtJS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GurLR21,
author = {Tom Gur and
Yang P. Liu and
Ron D. Rothblum},
title = {An Exponential Separation Between {MA} and {AM} Proofs of Proximity},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {12},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00212-3},
doi = {10.1007/S00037-021-00212-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GurLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItsyksonRSS21,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin
Formulas for All Constant-Degree Graphs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {13},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00213-2},
doi = {10.1007/S00037-021-00213-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ItsyksonRSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItsyksonRSS21a,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations
of Tseitin Formulas for All Constant-Degree Graphs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {16},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00216-z},
doi = {10.1007/S00037-021-00216-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ItsyksonRSS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Paradise21,
author = {Orr Paradise},
title = {Smooth and Strong PCPs},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.1007/s00037-020-00199-3},
doi = {10.1007/S00037-020-00199-3},
timestamp = {Fri, 08 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Paradise21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Paradise21a,
author = {Orr Paradise},
title = {Correction to: Smooth and Strong PCPs},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {9},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00208-z},
doi = {10.1007/S00037-021-00208-Z},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Paradise21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PartT21,
author = {Fedor Part and
Iddo Tzameret},
title = {Resolution with Counting: Dag-Like Lower Bounds and Different Moduli},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {2},
year = {2021},
url = {https://doi.org/10.1007/s00037-020-00202-x},
doi = {10.1007/S00037-020-00202-X},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PartT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PitassiSW21,
author = {Toniann Pitassi and
Morgan Shirley and
Thomas Watson},
title = {Nondeterministic and Randomized Boolean Hierarchies in Communication
Complexity},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {10},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00210-5},
doi = {10.1007/S00037-021-00210-5},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PitassiSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RezendeMNR21,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Robert Robere},
title = {Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {4},
year = {2021},
url = {https://doi.org/10.1007/s00037-020-00201-y},
doi = {10.1007/S00037-020-00201-Y},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RezendeMNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShaltielS21,
author = {Ronen Shaltiel and
Jad Silbak},
title = {Explicit List-Decodable Codes with Optimal Rate for Computationally
Bounded Channels},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {3},
year = {2021},
url = {https://doi.org/10.1007/s00037-020-00203-w},
doi = {10.1007/S00037-020-00203-W},
timestamp = {Fri, 29 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ShaltielS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sherstov21,
author = {Alexander A. Sherstov},
title = {The hardest halfspace},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {11},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00211-4},
doi = {10.1007/S00037-021-00211-4},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Sherstov21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SinhababuT21,
author = {Amit Sinhababu and
Thomas Thierauf},
title = {Factorization of Polynomials Given by Arithmetic Branching Programs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {15},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00215-0},
doi = {10.1007/S00037-021-00215-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/SinhababuT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ToranW21,
author = {Jacobo Tor{\'{a}}n and
Florian W{\"{o}}rz},
title = {Reversible Pebble Games and the Relation Between Tree-Like and General
Resolution Space},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {7},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00206-1},
doi = {10.1007/S00037-021-00206-1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ToranW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/VolkK21,
author = {Ben Lee Volk and
Mrinal Kumar},
title = {Lower Bounds for Matrix Factorization},
journal = {Comput. Complex.},
volume = {30},
number = {1},
pages = {6},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00205-2},
doi = {10.1007/S00037-021-00205-2},
timestamp = {Tue, 20 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/VolkK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FischerI20,
author = {Nick Fischer and
Christian Ikenmeyer},
title = {The Computational Complexity of Plethysm Coefficients},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {8},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00198-4},
doi = {10.1007/S00037-020-00198-4},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/FischerI20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GurjarT20,
author = {Rohit Gurjar and
Thomas Thierauf},
title = {Linear Matroid Intersection is in Quasi-NC},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {9},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00200-z},
doi = {10.1007/S00037-020-00200-Z},
timestamp = {Mon, 30 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GurjarT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HemaspaandraHSW20,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Holger Spakowski and
Osamu Watanabe},
title = {The Robustness of {LWPP} and WPP, with an Application to Graph Reconstruction},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {7},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00197-5},
doi = {10.1007/S00037-020-00197-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HemaspaandraHSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hrubes20,
author = {Pavel Hrubes},
title = {On {\(\epsilon\)}-sensitive monotone computations},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {6},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00196-6},
doi = {10.1007/S00037-020-00196-6},
timestamp = {Wed, 05 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Hrubes20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItoKN20,
author = {Hiro Ito and
Areej Khoury and
Ilan Newman},
title = {On the characterization of 1-sided error strongly testable graph properties
for bounded-degree graphs},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {1},
year = {2020},
url = {https://doi.org/10.1007/s00037-019-00191-6},
doi = {10.1007/S00037-019-00191-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ItoKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Meir20,
author = {Or Meir},
title = {Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {4},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00194-8},
doi = {10.1007/S00037-020-00194-8},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Meir20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PonomarenkoV20,
author = {Ilia Ponomarenko and
Andrey Vasil'ev},
title = {Two-closures of supersolvable permutation groups in polynomial time},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {5},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00195-7},
doi = {10.1007/S00037-020-00195-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PonomarenkoV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watson20,
author = {Thomas Watson},
title = {Communication Complexity with Small Advantage},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {2},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00192-w},
doi = {10.1007/S00037-020-00192-W},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Watson20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watson20a,
author = {Thomas Watson},
title = {Correction to: Communication complexity with small advantage},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {3},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00193-9},
doi = {10.1007/S00037-020-00193-9},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Watson20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AdveRY19,
author = {Anshul Adve and
Colleen Robichaux and
Alexander Yong},
title = {Vanishing of Littlewood-Richardson polynomials is in {P}},
journal = {Comput. Complex.},
volume = {28},
number = {2},
pages = {241--257},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00183-6},
doi = {10.1007/S00037-019-00183-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AdveRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ApplebaumR19,
author = {Benny Applebaum and
Pavel Raykov},
title = {On the Relationship Between Statistical Zero-Knowledge and Statistical
Randomized Encodings},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {573--616},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0170-x},
doi = {10.1007/S00037-018-0170-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BaartseM19,
author = {Martijn Baartse and
Klaus Meer},
title = {Interactive proofs and a Shamir-like result for real number computations},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {437--469},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0174-6},
doi = {10.1007/S00037-018-0174-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BaartseM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiC19,
author = {Jin{-}Yi Cai and
Xi Chen},
title = {A decidable dichotomy theorem on directed graph homomorphisms with
non-negative weights},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {345--408},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00184-5},
doi = {10.1007/S00037-019-00184-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CaiC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChattopadhyayKL19,
author = {Arkadev Chattopadhyay and
Michal Kouck{\'{y}} and
Bruno Loff and
Sagnik Mukhopadhyay},
title = {Simulation Theorems via Pseudo-random Properties},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {617--659},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00190-7},
doi = {10.1007/S00037-019-00190-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChattopadhyayKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChillaraM19,
author = {Suryajith Chillara and
Partha Mukhopadhyay},
title = {Depth-4 Lower Bounds, Determinantal Complexity: {A} Unified Approach},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {545--572},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00185-4},
doi = {10.1007/S00037-019-00185-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChillaraM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChristandlVZ19,
author = {Matthias Christandl and
P{\'{e}}ter Vrana and
Jeroen Zuiddam},
title = {Asymptotic tensor rank of graph tensors: beyond matrix multiplication},
journal = {Comput. Complex.},
volume = {28},
number = {1},
pages = {57--111},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0172-8},
doi = {10.1007/S00037-018-0172-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChristandlVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChristandlZ19,
author = {Matthias Christandl and
Jeroen Zuiddam},
title = {Tensor surgery and tensor rank},
journal = {Comput. Complex.},
volume = {28},
number = {1},
pages = {27--56},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0164-8},
doi = {10.1007/S00037-018-0164-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChristandlZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Goldreich19,
author = {Oded Goldreich},
title = {Hierarchy Theorems for Testing Properties in Size-Oblivious Query
Complexity},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {709--747},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00187-2},
doi = {10.1007/S00037-019-00187-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Goldreich19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosKP019,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
title = {Query-to-Communication Lifting for {P} {NP}},
journal = {Comput. Complex.},
volume = {28},
number = {1},
pages = {113--144},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0175-5},
doi = {10.1007/S00037-018-0175-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosKP019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosKPW19,
author = {Mika G{\"{o}}{\"{o}}s and
Pritish Kamath and
Toniann Pitassi and
Thomas Watson},
title = {Correction to: Query-to-Communication Lifting for {P} {NP}},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {543--544},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00180-9},
doi = {10.1007/S00037-019-00180-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosKPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KayalNS19,
author = {Neeraj Kayal and
Vineet Nair and
Chandan Saha},
title = {Average-case linear matrix factorization and reconstruction of low
width algebraic branching programs},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {749--828},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00189-0},
doi = {10.1007/S00037-019-00189-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KayalNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KolMSY19,
author = {Gillat Kol and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
title = {Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle
Bound},
journal = {Comput. Complex.},
volume = {28},
number = {1},
pages = {1--25},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0176-4},
doi = {10.1007/S00037-018-0176-4},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KolMSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kumar19,
author = {Mrinal Kumar},
title = {A quadratic lower bound for homogeneous algebraic branching programs},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {409--435},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00186-3},
doi = {10.1007/S00037-019-00186-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kumar19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LagardeLS19,
author = {Guillaume Lagarde and
Nutan Limaye and
Srikanth Srinivasan},
title = {Lower Bounds and {PIT} for Non-commutative Arithmetic Circuits with
Restricted Parse Trees},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {471--542},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0171-9},
doi = {10.1007/S00037-018-0171-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/LagardeLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Meir19,
author = {Or Meir},
title = {On Derandomized Composition of Boolean Functions},
journal = {Comput. Complex.},
volume = {28},
number = {4},
pages = {661--708},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00188-1},
doi = {10.1007/S00037-019-00188-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Meir19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MeirW19,
author = {Or Meir and
Avi Wigderson},
title = {Prediction from Partial Information and Hindsight, with Application
to Circuit Lower Bounds},
journal = {Comput. Complex.},
volume = {28},
number = {2},
pages = {145--183},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00177-4},
doi = {10.1007/S00037-019-00177-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MeirW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PudlakT19,
author = {Pavel Pudl{\'{a}}k and
Neil Thapen},
title = {Random resolution refutations},
journal = {Comput. Complex.},
volume = {28},
number = {2},
pages = {185--239},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00182-7},
doi = {10.1007/S00037-019-00182-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PudlakT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Tell19,
author = {Roei Tell},
title = {Improved Bounds for Quantified Derandomization of Constant-Depth Circuits
and Polynomials},
journal = {Comput. Complex.},
volume = {28},
number = {2},
pages = {259--343},
year = {2019},
url = {https://doi.org/10.1007/s00037-019-00179-2},
doi = {10.1007/S00037-019-00179-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Tell19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArvindS18,
author = {Vikraman Arvind and
Srikanth Srinivasan},
title = {On the hardness of the noncommutative determinant},
journal = {Comput. Complex.},
volume = {27},
number = {1},
pages = {1--29},
year = {2018},
url = {https://doi.org/10.1007/s00037-016-0148-5},
doi = {10.1007/S00037-016-0148-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ArvindS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BauwensMVZ18,
author = {Bruno Bauwens and
Anton Makhlin and
Nikolai K. Vereshchagin and
Marius Zimand},
title = {Short lists with short programs in short time},
journal = {Comput. Complex.},
volume = {27},
number = {1},
pages = {31--61},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0154-2},
doi = {10.1007/S00037-017-0154-2},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BauwensMVZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CanonneG18,
author = {Cl{\'{e}}ment L. Canonne and
Tom Gur},
title = {An adaptivity hierarchy theorem for property testing},
journal = {Comput. Complex.},
volume = {27},
number = {4},
pages = {671--716},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0168-4},
doi = {10.1007/S00037-018-0168-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CanonneG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DinurM18,
author = {Irit Dinur and
Or Meir},
title = {Toward the {KRW} Composition Conjecture: Cubic Formula Lower Bounds
via Communication Complexity},
journal = {Comput. Complex.},
volume = {27},
number = {3},
pages = {375--462},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0159-x},
doi = {10.1007/S00037-017-0159-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DinurM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FominGNS18,
author = {Sergey Fomin and
Dima Grigoriev and
Dorian Nogneng and
{\'{E}}ric Schost},
title = {On semiring complexity of Schur polynomials},
journal = {Comput. Complex.},
volume = {27},
number = {4},
pages = {595--616},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0169-3},
doi = {10.1007/S00037-018-0169-3},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/FominGNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GhaziKKS18,
author = {Badih Ghazi and
Ilan Komargodski and
Pravesh K. Kothari and
Madhu Sudan},
title = {Communication with Contextual Uncertainty},
journal = {Comput. Complex.},
volume = {27},
number = {3},
pages = {463--509},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0161-3},
doi = {10.1007/S00037-017-0161-3},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GhaziKKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichT18,
author = {Oded Goldreich and
Avishay Tal},
title = {Matrix rigidity of random Toeplitz matrices},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {305--350},
year = {2018},
url = {https://doi.org/10.1007/s00037-016-0144-9},
doi = {10.1007/S00037-016-0144-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoosPW18,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
title = {The Landscape of Communication Complexity Classes},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {245--304},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0166-6},
doi = {10.1007/S00037-018-0166-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoosPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GurR18,
author = {Tom Gur and
Ron D. Rothblum},
title = {Non-interactive proofs of proximity},
journal = {Comput. Complex.},
volume = {27},
number = {1},
pages = {99--207},
year = {2018},
url = {https://doi.org/10.1007/s00037-016-0136-9},
doi = {10.1007/S00037-016-0136-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GurR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HitchcockS18,
author = {John M. Hitchcock and
Hadi Shafei},
title = {Autoreducibility of NP-Complete Sets under Strong Hypotheses},
journal = {Comput. Complex.},
volume = {27},
number = {1},
pages = {63--97},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0157-z},
doi = {10.1007/S00037-017-0157-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HitchcockS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IvanyosQS18,
author = {G{\'{a}}bor Ivanyos and
Youming Qiao and
K. V. Subrahmanyam},
title = {Constructive non-commutative rank computation is in deterministic
polynomial time},
journal = {Comput. Complex.},
volume = {27},
number = {4},
pages = {561--593},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0165-7},
doi = {10.1007/S00037-018-0165-7},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/IvanyosQS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PandeySS18,
author = {Anurag Pandey and
Nitin Saxena and
Amit Sinhababu},
title = {Algebraic independence over positive characteristic: New criterion
and applications to locally low-algebraic-rank circuits},
journal = {Comput. Complex.},
volume = {27},
number = {4},
pages = {617--670},
year = {2018},
url = {https://doi.org/10.1007/s00037-018-0167-5},
doi = {10.1007/S00037-018-0167-5},
timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PandeySS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Razborov18,
author = {Alexander A. Razborov},
title = {On Space and Depth in Resolution},
journal = {Comput. Complex.},
volume = {27},
number = {3},
pages = {511--559},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0163-1},
doi = {10.1007/S00037-017-0163-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Razborov18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Rossman18,
author = {Benjamin Rossman},
title = {The Average Sensitivity of Bounded-Depth Formulas},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {209--223},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0156-0},
doi = {10.1007/S00037-017-0156-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Rossman18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Valiant18,
author = {Leslie G. Valiant},
title = {Some observations on holographic algorithms},
journal = {Comput. Complex.},
volume = {27},
number = {3},
pages = {351--374},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0160-4},
doi = {10.1007/S00037-017-0160-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Valiant18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ViolaW18,
author = {Emanuele Viola and
Avi Wigderson},
title = {Local Expanders},
journal = {Comput. Complex.},
volume = {27},
number = {2},
pages = {225--244},
year = {2018},
url = {https://doi.org/10.1007/s00037-017-0155-1},
doi = {10.1007/S00037-017-0155-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ViolaW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderGM17,
author = {Eric Allender and
Anna G{\'{a}}l and
Ian Mertz},
title = {Dual {VP} Classes},
journal = {Comput. Complex.},
volume = {26},
number = {3},
pages = {583--625},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0146-7},
doi = {10.1007/S00037-016-0146-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AllenderGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderHK17,
author = {Eric Allender and
Dhiraj Holden and
Valentine Kabanets},
title = {The Minimum Oracle Circuit Size Problem},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {469--496},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0124-0},
doi = {10.1007/S00037-016-0124-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AllenderHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArvindKRV17,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler and
Gaurav Rattan and
Oleg Verbitsky},
title = {Graph Isomorphism, Color Refinement, and Compactness},
journal = {Comput. Complex.},
volume = {26},
number = {3},
pages = {627--685},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0147-6},
doi = {10.1007/S00037-016-0147-6},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ArvindKRV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AydinliogluM17,
author = {Baris Aydinlioglu and
Dieter van Melkebeek},
title = {Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin
games},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {79--118},
year = {2017},
url = {https://doi.org/10.1007/s00037-014-0095-y},
doi = {10.1007/S00037-014-0095-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AydinliogluM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BampasGPT17,
author = {Evangelos Bampas and
Andreas{-}Nikolas G{\"{o}}bel and
Aris Pagourtzis and
Aris Tentes},
title = {On the connection between interval size functions and path counting},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {421--467},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0137-8},
doi = {10.1007/S00037-016-0137-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BampasGPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigiEG17,
author = {Salman Beigi and
Omid Etesami and
Amin Gohari},
title = {The Value of Help Bits in Randomized and Average-Case Complexity},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {119--145},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0135-x},
doi = {10.1007/S00037-016-0135-X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigiEG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-SassonRS17,
author = {Eli Ben{-}Sasson and
Noga Ron{-}Zewi and
Madhu Sudan},
title = {Sparse affine-invariant linear codes are locally testable},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {37--77},
year = {2017},
url = {https://doi.org/10.1007/s00037-015-0115-6},
doi = {10.1007/S00037-015-0115-6},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Ben-SassonRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BraunJLP17,
author = {G{\'{a}}bor Braun and
Rahul Jain and
Troy Lee and
Sebastian Pokutta},
title = {Information-theoretic approximations of the nonnegative rank},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {147--197},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0125-z},
doi = {10.1007/S00037-016-0125-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BraunJLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DoronST17,
author = {Dean Doron and
Amir Sarid and
Amnon Ta{-}Shma},
title = {On Approximating the Eigenvalues of Stochastic Matrices in Probabilistic
Logspace},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {393--420},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0150-y},
doi = {10.1007/S00037-016-0150-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DoronST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GabrielovV17,
author = {Andrei Gabrielov and
Nicolai N. Vorobjov Jr.},
title = {Topological lower bounds for arithmetic networks},
journal = {Comput. Complex.},
volume = {26},
number = {3},
pages = {687--715},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0145-8},
doi = {10.1007/S00037-016-0145-8},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GabrielovV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldbergG17,
author = {Leslie Ann Goldberg and
Heng Guo},
title = {The Complexity of Approximating complex-valued Ising and Tutte partition
functions},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {765--833},
year = {2017},
url = {https://doi.org/10.1007/s00037-017-0162-2},
doi = {10.1007/S00037-017-0162-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldbergG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GreenKV17,
author = {Frederic Green and
Daniel Kreymer and
Emanuele Viola},
title = {Block-symmetric polynomials correlate with parity better than symmetric},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {323--364},
year = {2017},
url = {https://doi.org/10.1007/s00037-017-0153-3},
doi = {10.1007/S00037-017-0153-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GreenKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorescuP17,
author = {Elena Grigorescu and
Chris Peikert},
title = {List-Decoding Barnes-Wall Lattices},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {365--392},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0151-x},
doi = {10.1007/S00037-016-0151-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigorescuP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GurjarKST17,
author = {Rohit Gurjar and
Arpita Korwar and
Nitin Saxena and
Thomas Thierauf},
title = {Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic
Branching Programs},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {835--880},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0141-z},
doi = {10.1007/S00037-016-0141-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GurjarKST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HavivX17,
author = {Ishay Haviv and
Ning Xie},
title = {Sunflowers and Testing Triangle-Freeness of Functions},
journal = {Comput. Complex.},
volume = {26},
number = {2},
pages = {497--530},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0138-7},
doi = {10.1007/S00037-016-0138-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HavivX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IkenmeyerMW17,
author = {Christian Ikenmeyer and
Ketan D. Mulmuley and
Michael Walter},
title = {On vanishing of Kronecker coefficients},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {949--992},
year = {2017},
url = {https://doi.org/10.1007/s00037-017-0158-y},
doi = {10.1007/S00037-017-0158-Y},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/IkenmeyerMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoK17,
author = {Russell Impagliazzo and
Valentine Kabanets},
title = {Fourier Concentration from Shrinkage},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {275--321},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0134-y},
doi = {10.1007/S00037-016-0134-Y},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IvanyosQS17,
author = {G{\'{a}}bor Ivanyos and
Youming Qiao and
K. V. Subrahmanyam},
title = {Non-commutative Edmonds' problem and matrix semi-invariants},
journal = {Comput. Complex.},
volume = {26},
number = {3},
pages = {717--763},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0143-x},
doi = {10.1007/S00037-016-0143-X},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/IvanyosQS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/JainWYZ17,
author = {Rahul Jain and
Zhaohui Wei and
Penghui Yao and
Shengyu Zhang},
title = {Multipartite Quantum Correlation and Communication Complexities},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {199--228},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0126-y},
doi = {10.1007/S00037-016-0126-Y},
timestamp = {Thu, 01 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/JainWYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LauriaN17,
author = {Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Tight Size-Degree Bounds for Sums-of-Squares Proofs},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {911--948},
year = {2017},
url = {https://doi.org/10.1007/s00037-017-0152-4},
doi = {10.1007/S00037-017-0152-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LauriaN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Moshkovitz17,
author = {Dana Moshkovitz},
title = {Low-degree test with polynomially small error},
journal = {Comput. Complex.},
volume = {26},
number = {3},
pages = {531--582},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0149-4},
doi = {10.1007/S00037-016-0149-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Moshkovitz17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MukhopadhyayQ17,
author = {Priyanka Mukhopadhyay and
Youming Qiao},
title = {Sparse multivariate polynomial interpolation on the basis of Schubert
polynomials},
journal = {Comput. Complex.},
volume = {26},
number = {4},
pages = {881--909},
year = {2017},
url = {https://doi.org/10.1007/s00037-016-0142-y},
doi = {10.1007/S00037-016-0142-Y},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MukhopadhyayQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PakP17,
author = {Igor Pak and
Greta Panova},
title = {On the complexity of computing Kronecker coefficients},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {1--36},
year = {2017},
url = {https://doi.org/10.1007/s00037-015-0109-4},
doi = {10.1007/S00037-015-0109-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PakP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShpilkaTV17,
author = {Amir Shpilka and
Avishay Tal and
Ben lee Volk},
title = {On the Structure of Boolean Functions with Small Spectral Norm},
journal = {Comput. Complex.},
volume = {26},
number = {1},
pages = {229--273},
year = {2017},
url = {https://doi.org/10.1007/s00037-015-0110-y},
doi = {10.1007/S00037-015-0110-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ShpilkaTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AehligCN16,
author = {Klaus Aehlig and
Stephen A. Cook and
Phuong Nguyen},
title = {Relativizing small complexity classes and their theories},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {177--215},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0113-8},
doi = {10.1007/S00037-015-0113-8},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AehligCN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderW16,
author = {Eric Allender and
Fengming Wang},
title = {On the power of algebraic branching programs of width two},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {217--253},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0114-7},
doi = {10.1007/S00037-015-0114-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AllenderW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AmbainisINNRTY16,
author = {Andris Ambainis and
Kazuo Iwama and
Masaki Nakanishi and
Harumichi Nishimura and
Rudy Raymond and
Seiichiro Tani and
Shigeru Yamashita},
title = {Quantum Query Complexity of Almost All Functions with Fixed On-set
Size},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {723--735},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0139-6},
doi = {10.1007/S00037-016-0139-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AmbainisINNRTY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Applebaum16,
author = {Benny Applebaum},
title = {Cryptographic Hardness of Random Local Functions - Survey},
journal = {Comput. Complex.},
volume = {25},
number = {3},
pages = {667--722},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0121-8},
doi = {10.1007/S00037-015-0121-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Applebaum16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ApplebaumASY16,
author = {Benny Applebaum and
Sergei Artemenko and
Ronen Shaltiel and
Guang Yang},
title = {Incompressible Functions, Relative-Error Extractors, and the Power
of Nondeterministic Reductions},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {349--418},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0128-9},
doi = {10.1007/S00037-016-0128-9},
timestamp = {Mon, 21 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumASY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlondinKM16,
author = {Michael Blondin and
Andreas Krebs and
Pierre McKenzie},
title = {The complexity of intersecting finite automata having few final states},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {775--814},
year = {2016},
url = {https://doi.org/10.1007/s00037-014-0089-9},
doi = {10.1007/S00037-014-0089-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BlondinKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BourgainDL16,
author = {Jean Bourgain and
Zeev Dvir and
Ethan Leeman},
title = {Affine extractors over large fields with exponential error},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {921--931},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0108-5},
doi = {10.1007/S00037-015-0108-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BourgainDL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChaillouxKR16,
author = {Andr{\'{e}} Chailloux and
Iordanis Kerenidis and
Bill Rosgen},
title = {Quantum commitments from complexity assumptions},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {103--151},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0116-5},
doi = {10.1007/S00037-015-0116-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChaillouxKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DvirZ16,
author = {Zeev Dvir and
David Zuckerman},
title = {Special issue "Computational Complexity Conference 2015" Guest Editors'
Foreword},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {305--307},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0133-z},
doi = {10.1007/S00037-016-0133-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DvirZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/EvainLR16,
author = {Laurent Evain and
Mathias Lederer and
Bjarke Hammersholt Roune},
title = {Connect Four and Graph Decomposition},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {815--848},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0123-1},
doi = {10.1007/S00037-016-0123-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/EvainLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Goldreich16,
author = {Oded Goldreich},
title = {Special Issue on the 10th Theory of Cryptography Conference: Editor's
Foreword},
journal = {Comput. Complex.},
volume = {25},
number = {3},
pages = {563--565},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0119-2},
doi = {10.1007/S00037-015-0119-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Goldreich16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HuangL16,
author = {Sangxia Huang and
Pinyan Lu},
title = {A Dichotomy for Real Weighted Holant Problems},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {255--304},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0118-3},
doi = {10.1007/S00037-015-0118-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HuangL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HughesMPRS16,
author = {Andrew Hughes and
Debasis Mandal and
Aduri Pavan and
Nathan Russell and
Alan L. Selman},
title = {A thirty Year old conjecture about promise problems},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {883--919},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0107-6},
doi = {10.1007/S00037-015-0107-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HughesMPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KayalS16,
author = {Neeraj Kayal and
Chandan Saha},
title = {Lower Bounds for Depth-Three Arithmetic Circuits with small bottom
fanin},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {419--454},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0132-0},
doi = {10.1007/S00037-016-0132-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KayalS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KrennPWW16,
author = {Stephan Krenn and
Krzysztof Pietrzak and
Akshay Wadia and
Daniel Wichs},
title = {A counterexample to the chain rule for conditional {HILL} entropy},
journal = {Comput. Complex.},
volume = {25},
number = {3},
pages = {567--605},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0120-9},
doi = {10.1007/S00037-015-0120-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KrennPWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Meir16,
author = {Or Meir},
title = {Combinatorial PCPs with Short Proofs},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {1--102},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0111-x},
doi = {10.1007/S00037-015-0111-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Meir16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Oliveira16,
author = {Rafael Oliveira},
title = {Factors of low individual degree polynomials},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {507--561},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0130-2},
doi = {10.1007/S00037-016-0130-2},
timestamp = {Wed, 10 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Oliveira16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/OliveiraSV16,
author = {Rafael Oliveira and
Amir Shpilka and
Ben lee Volk},
title = {Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {455--505},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0131-1},
doi = {10.1007/S00037-016-0131-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/OliveiraSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Pass16,
author = {Rafael Pass},
title = {Unprovable Security of Perfect {NIZK} and Non-interactive Non-malleable
Commitments},
journal = {Comput. Complex.},
volume = {25},
number = {3},
pages = {607--666},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0122-2},
doi = {10.1007/S00037-016-0122-2},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Pass16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SamorodnitskySY16,
author = {Alex Samorodnitsky and
Ilya D. Shkredov and
Sergey Yekhanin},
title = {Kolmogorov Width of Discrete Linear Spaces: an Approach to Matrix
Rigidity},
journal = {Comput. Complex.},
volume = {25},
number = {2},
pages = {309--348},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0129-8},
doi = {10.1007/S00037-016-0129-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SamorodnitskySY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TakahashiT16,
author = {Yasuhiro Takahashi and
Seiichiro Tani},
title = {Collapse of the Hierarchy of Constant-Depth Exact Quantum Circuits},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {849--881},
year = {2016},
url = {https://doi.org/10.1007/s00037-016-0140-0},
doi = {10.1007/S00037-016-0140-0},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TakahashiT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watson16,
author = {Thomas Watson},
title = {The complexity of estimating min-entropy},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {153--175},
year = {2016},
url = {https://doi.org/10.1007/s00037-014-0091-2},
doi = {10.1007/S00037-014-0091-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Watson16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Yoshida16,
author = {Yuichi Yoshida},
title = {Testing list H-homomorphisms},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {737--773},
year = {2016},
url = {https://doi.org/10.1007/s00037-014-0093-0},
doi = {10.1007/S00037-014-0093-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Yoshida16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/000115,
author = {Thomas Watson},
title = {Query Complexity in Errorless Hardness Amplification},
journal = {Comput. Complex.},
volume = {24},
number = {4},
pages = {823--850},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0117-4},
doi = {10.1007/S00037-015-0117-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/000115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AdaCFN15,
author = {Anil Ada and
Arkadev Chattopadhyay and
Omar Fawzi and
Phuong Nguyen},
title = {The {NOF} Multiparty Communication Complexity of Composed Functions},
journal = {Comput. Complex.},
volume = {24},
number = {3},
pages = {645--694},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0078-4},
doi = {10.1007/S00037-013-0078-4},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AdaCFN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlonC15,
author = {Noga Alon and
Gil Cohen},
title = {On Rigid Matrices and U-Polynomials},
journal = {Comput. Complex.},
volume = {24},
number = {4},
pages = {851--879},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0112-9},
doi = {10.1007/S00037-015-0112-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlonC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AndersonMV15,
author = {Matthew Anderson and
Dieter van Melkebeek and
Ilya Volkovich},
title = {Deterministic polynomial identity tests for multilinear bounded-read
formulae},
journal = {Comput. Complex.},
volume = {24},
number = {4},
pages = {695--776},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0097-4},
doi = {10.1007/S00037-015-0097-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AndersonMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Belovs15,
author = {Aleksandrs Belovs},
title = {Quantum Algorithms for Learning Symmetric Juntas via the Adversary
Bound},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {255--293},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0099-2},
doi = {10.1007/S00037-015-0099-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Belovs15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-SassonV15,
author = {Eli Ben{-}Sasson and
Michael Viderman},
title = {Composition of semi-LTCs by two-wise tensor products},
journal = {Comput. Complex.},
volume = {24},
number = {3},
pages = {601--643},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0074-8},
doi = {10.1007/S00037-013-0074-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ben-SassonV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BhattacharyyaX15,
author = {Arnab Bhattacharyya and
Ning Xie},
title = {Lower bounds for testing triangle-freeness in Boolean functions},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {65--101},
year = {2015},
url = {https://doi.org/10.1007/s00037-014-0092-1},
doi = {10.1007/S00037-014-0092-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BhattacharyyaX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BussW15,
author = {Samuel R. Buss and
Ryan Williams},
title = {Limits on Alternation Trading Proofs for Time-Space Lower Bounds},
journal = {Comput. Complex.},
volume = {24},
number = {3},
pages = {533--600},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0104-9},
doi = {10.1007/S00037-015-0104-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BussW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChenKKSZ15,
author = {Ruiwen Chen and
Valentine Kabanets and
Antonina Kolokolova and
Ronen Shaltiel and
David Zuckerman},
title = {Mining Circuit Lower Bound Proofs for Meta-Algorithms},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {333--392},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0100-0},
doi = {10.1007/S00037-015-0100-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChenKKSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CooneyJPP15,
author = {Tom Cooney and
Marius Junge and
Carlos Palazuelos and
David P{\'{e}}rez{-}Garc{\'{\i}}a},
title = {Rank-one quantum games},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {133--196},
year = {2015},
url = {https://doi.org/10.1007/s00037-014-0096-x},
doi = {10.1007/S00037-014-0096-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CooneyJPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DinurSV15,
author = {Irit Dinur and
David Steurer and
Thomas Vidick},
title = {A parallel repetition theorem for entangled projection games},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {201--254},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0098-3},
doi = {10.1007/S00037-015-0098-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DinurSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FournierMM15,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
title = {Monomials in Arithmetic Circuits: Complete Problems in the Counting
Hierarchy},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {1--30},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0079-3},
doi = {10.1007/S00037-013-0079-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FournierMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorievP15,
author = {Dima Grigoriev and
Vladimir V. Podolskii},
title = {Complexity of Tropical and Min-plus Linear Prevarieties},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {31--64},
year = {2015},
url = {https://doi.org/10.1007/s00037-013-0077-5},
doi = {10.1007/S00037-013-0077-5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GrigorievP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grochow15,
author = {Joshua A. Grochow},
title = {Unifying Known Lower Bounds via Geometric Complexity Theory},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {393--475},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0103-x},
doi = {10.1007/S00037-015-0103-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grochow15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Haviv15,
author = {Ishay Haviv},
title = {The remote set problem on lattices},
journal = {Comput. Complex.},
volume = {24},
number = {1},
pages = {103--131},
year = {2015},
url = {https://doi.org/10.1007/s00037-014-0094-z},
doi = {10.1007/S00037-014-0094-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Haviv15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoppartySS15,
author = {Swastik Kopparty and
Shubhangi Saraf and
Amir Shpilka},
title = {Equivalence of Polynomial Identity Testing and Polynomial Factorization},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {295--331},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0102-y},
doi = {10.1007/S00037-015-0102-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KoppartySS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Saks15,
author = {Michael E. Saks},
title = {Special issue "Conference on Computational Complexity 2014" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {24},
number = {2},
pages = {197--199},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0101-z},
doi = {10.1007/S00037-015-0101-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Saks15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShpilkaV15,
author = {Amir Shpilka and
Ilya Volkovich},
title = {Read-once polynomial identity testing},
journal = {Comput. Complex.},
volume = {24},
number = {3},
pages = {477--532},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0105-8},
doi = {10.1007/S00037-015-0105-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ShpilkaV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Storjohann15,
author = {Arne Storjohann},
title = {On the complexity of inverting integer and polynomial matrices},
journal = {Comput. Complex.},
volume = {24},
number = {4},
pages = {777--821},
year = {2015},
url = {https://doi.org/10.1007/s00037-015-0106-7},
doi = {10.1007/S00037-015-0106-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Storjohann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/0001KQ14,
author = {Ankit Gupta and
Neeraj Kayal and
Youming Qiao},
title = {Random arithmetic formulas can be reconstructed efficiently},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {207--303},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0085-0},
doi = {10.1007/S00037-014-0085-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/0001KQ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AmbainisW14,
author = {Andris Ambainis and
Ronald de Wolf},
title = {How Low can Approximate Degree and Quantum Query Complexity be for
Total Boolean Functions?},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {305--322},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0083-2},
doi = {10.1007/S00037-014-0083-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AmbainisW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArtemenkoS14,
author = {Sergei Artemenko and
Ronen Shaltiel},
title = {Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions
Showing Hardness Amplification},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {43--83},
year = {2014},
url = {https://doi.org/10.1007/s00037-012-0056-2},
doi = {10.1007/S00037-012-0056-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ArtemenkoS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelDKW14,
author = {Amos Beimel and
Sebastian Ben Daniel and
Eyal Kushilevitz and
Enav Weinreb},
title = {Choosing, Agreeing, and Eliminating in Communication Complexity},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {1--42},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0075-7},
doi = {10.1007/S00037-013-0075-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeimelDKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BelovsR14,
author = {Aleksandrs Belovs and
Ansis Rosmanis},
title = {On the Power of Non-adaptive Learning Graphs},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {323--354},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0084-1},
doi = {10.1007/S00037-014-0084-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BelovsR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DavidP14,
author = {Matei David and
Periklis A. Papakonstantinou},
title = {Tradeoff lower lounds for stack machines},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {99--146},
year = {2014},
url = {https://doi.org/10.1007/s00037-012-0057-1},
doi = {10.1007/S00037-012-0057-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DavidP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DvirKL14,
author = {Zeev Dvir and
J{\'{a}}nos Koll{\'{a}}r and
Shachar Lovett},
title = {Variety Evasive Sets},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {509--529},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0073-9},
doi = {10.1007/S00037-013-0073-9},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DvirKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GarvinSTV14,
author = {Brady Garvin and
Derrick Stolee and
Raghunath Tewari and
N. V. Vinodchandran},
title = {ReachFewL = ReachUL},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {85--98},
year = {2014},
url = {https://doi.org/10.1007/s00037-012-0050-8},
doi = {10.1007/S00037-012-0050-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GarvinSTV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kane14,
author = {Daniel M. Kane},
title = {The correct exponent for the Gotsman-Linial Conjecture},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {151--175},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0086-z},
doi = {10.1007/S00037-014-0086-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kane14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KumarLPS14,
author = {Abhinav Kumar and
Satyanarayana V. Lokam and
Vijay M. Patankar and
Jayalal Sarma},
title = {Using Elimination Theory to Construct Rigid Matrices},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {531--563},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0061-0},
doi = {10.1007/S00037-013-0061-0},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KumarLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MacielNP14,
author = {Alexis Maciel and
Phuong Nguyen and
Toniann Pitassi},
title = {Lifting lower bounds for tree-like proofs},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {585--636},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0064-x},
doi = {10.1007/S00037-013-0064-X},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MacielNP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Meir14,
author = {Or Meir},
title = {Combinatorial PCPs with Efficient Verifiers},
journal = {Comput. Complex.},
volume = {23},
number = {3},
pages = {355--478},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0080-5},
doi = {10.1007/S00037-014-0080-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Meir14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MundhenkW14,
author = {Martin Mundhenk and
Felix Weiss},
title = {An {AC} 1-complete model checking problem for intuitionistic logic},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {637--669},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0062-z},
doi = {10.1007/S00037-013-0062-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MundhenkW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SanthanamW14,
author = {Rahul Santhanam and
Ryan Williams},
title = {On Uniformity and Circuit Lower Bounds},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {177--205},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0087-y},
doi = {10.1007/S00037-014-0087-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SanthanamW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Teutsch14,
author = {Jason Teutsch},
title = {Short lists for shortest descriptions in short time},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {565--583},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0090-3},
doi = {10.1007/S00037-014-0090-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Teutsch14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Umans14,
author = {Christopher Umans},
title = {Special Issue "Conference on Computational Complexity 2013" Guest
editor's foreword},
journal = {Comput. Complex.},
volume = {23},
number = {2},
pages = {147--149},
year = {2014},
url = {https://doi.org/10.1007/s00037-014-0088-x},
doi = {10.1007/S00037-014-0088-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Umans14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Viola14,
author = {Emanuele Viola},
title = {Randomness Buys Depth for Approximate Counting},
journal = {Comput. Complex.},
volume = {23},
number = {3},
pages = {479--508},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0076-6},
doi = {10.1007/S00037-013-0076-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Viola14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlonSU13,
author = {Noga Alon and
Amir Shpilka and
Christopher Umans},
title = {On sunflowers and matrix multiplication},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {219--243},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0060-1},
doi = {10.1007/S00037-013-0060-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AlonSU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarakD13,
author = {Boaz Barak and
Irit Dinur},
title = {Special Issue "Conference on Computational Complexity 2012" Guest
editors' foreword},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {215--217},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0070-z},
doi = {10.1007/S00037-013-0070-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BarakD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-EliezerKKR13,
author = {Ido Ben{-}Eliezer and
Tali Kaufman and
Michael Krivelevich and
Dana Ron},
title = {Comparing the strength of query types in property testing: The case
of k-colorability},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {89--135},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0048-2},
doi = {10.1007/S00037-012-0048-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ben-EliezerKKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CheeFLWZ13,
author = {Yeow Meng Chee and
Tao Feng and
San Ling and
Huaxiong Wang and
Liang Feng Zhang},
title = {Query-Efficient Locally Decodable Codes of Subexponential Length},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {159--189},
year = {2013},
url = {https://doi.org/10.1007/s00037-011-0017-1},
doi = {10.1007/S00037-011-0017-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CheeFLWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DantchevM13,
author = {Stefan S. Dantchev and
Barnaby Martin},
title = {Rank complexity gap for Lov{\'{a}}sz-Schrijver and Sherali-Adams
proof systems},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {191--213},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0049-1},
doi = {10.1007/S00037-012-0049-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DantchevM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DellKMW13,
author = {Holger Dell and
Valentine Kabanets and
Dieter van Melkebeek and
Osamu Watanabe},
title = {Is Valiant-Vazirani's isolation probability improvable?},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {345--383},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0059-7},
doi = {10.1007/S00037-013-0059-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DellKMW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DiakonikolasS13,
author = {Ilias Diakonikolas and
Rocco A. Servedio},
title = {Improved Approximation of Linear Threshold Functions},
journal = {Comput. Complex.},
volume = {22},
number = {3},
pages = {623--677},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0045-5},
doi = {10.1007/S00037-012-0045-5},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DiakonikolasS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FordG13,
author = {Jeff Ford and
Anna G{\'{a}}l},
title = {Hadamard tensors and lower bounds on multiparty communication complexity},
journal = {Comput. Complex.},
volume = {22},
number = {3},
pages = {595--622},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0052-6},
doi = {10.1007/S00037-012-0052-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FordG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GopalanMR13,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} sparsification and a faster deterministic counting algorithm},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {275--310},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0068-6},
doi = {10.1007/S00037-013-0068-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GopalanMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorescuKS13,
author = {Elena Grigorescu and
Tali Kaufman and
Madhu Sudan},
title = {2-Transitivity is Insufficient for Local Testability},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {137--158},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0055-3},
doi = {10.1007/S00037-012-0055-3},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GrigorescuKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grigoriev13,
author = {Dima Grigoriev},
title = {Complexity of Solving Tropical Linear Systems},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {71--88},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0053-5},
doi = {10.1007/S00037-012-0053-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grigoriev13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GutoskiW13,
author = {Gus Gutoski and
Xiaodi Wu},
title = {Parallel Approximation of Min-Max Problems},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {385--428},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0065-9},
doi = {10.1007/S00037-013-0065-9},
timestamp = {Tue, 10 Dec 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GutoskiW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/JansenMR13,
author = {Maurice J. Jansen and
Meena Mahajan and
B. V. Raghavendra Rao},
title = {Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits},
journal = {Comput. Complex.},
volume = {22},
number = {3},
pages = {517--564},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0072-x},
doi = {10.1007/S00037-013-0072-X},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/JansenMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeeR13,
author = {Troy Lee and
J{\'{e}}r{\'{e}}mie Roland},
title = {A strong direct product theorem for quantum query complexity},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {429--462},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0066-8},
doi = {10.1007/S00037-013-0066-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LeeR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LiptonW13,
author = {Richard J. Lipton and
Ryan Williams},
title = {Amplifying circuit lower bounds against polynomial time, with applications},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {311--343},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0069-5},
doi = {10.1007/S00037-013-0069-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LiptonW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LovettMS13,
author = {Shachar Lovett and
Partha Mukhopadhyay and
Amir Shpilka},
title = {Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree
polynomials over finite fields},
journal = {Comput. Complex.},
volume = {22},
number = {4},
pages = {679--725},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0051-7},
doi = {10.1007/S00037-012-0051-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/LovettMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MahajanR13,
author = {Meena Mahajan and
B. V. Raghavendra Rao},
title = {Small Space Analogues of Valiant's Classes and the Limitations of
Skew Formulas},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {1--38},
year = {2013},
url = {https://doi.org/10.1007/s00037-011-0024-2},
doi = {10.1007/S00037-011-0024-2},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MahajanR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Olshanskii13,
author = {Alexander Yu. Olshanskii},
title = {Space Functions and Space Complexity of the Word Problem in Semigroups},
journal = {Comput. Complex.},
volume = {22},
number = {4},
pages = {771--830},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0058-0},
doi = {10.1007/S00037-012-0058-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Olshanskii13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PoteauxS13,
author = {Adrien Poteaux and
{\'{E}}ric Schost},
title = {Modular Composition Modulo Triangular Sets and Applications},
journal = {Comput. Complex.},
volume = {22},
number = {3},
pages = {463--516},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0063-y},
doi = {10.1007/S00037-013-0063-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PoteauxS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SahaSS13,
author = {Chandan Saha and
Ramprasad Saptharishi and
Nitin Saxena},
title = {A Case of Depth-3 Identity Testing, Sparse Factorization and Duality},
journal = {Comput. Complex.},
volume = {22},
number = {1},
pages = {39--69},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0054-4},
doi = {10.1007/S00037-012-0054-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SahaSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SetoT13,
author = {Kazuhisa Seto and
Suguru Tamaki},
title = {A satisfiability algorithm and average-case hardness for formulas
over the full binary basis},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {245--274},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0067-7},
doi = {10.1007/S00037-013-0067-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/SetoT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shaltiel13,
author = {Ronen Shaltiel},
title = {Derandomized Parallel Repetition Theorems for Free Games},
journal = {Comput. Complex.},
volume = {22},
number = {3},
pages = {565--594},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0071-y},
doi = {10.1007/S00037-013-0071-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shaltiel13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watson13,
author = {Thomas Watson},
title = {Pseudorandom generators for combinatorial checkerboards},
journal = {Comput. Complex.},
volume = {22},
number = {4},
pages = {727--769},
year = {2013},
url = {https://doi.org/10.1007/s00037-012-0036-6},
doi = {10.1007/S00037-012-0036-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Watson13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlpertI12,
author = {Hannah Alpert and
Jennifer Iglesias},
title = {Length 3 Edge-Disjoint Paths Is NP-Hard},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {511--513},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0038-4},
doi = {10.1007/S00037-012-0038-4},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AlpertI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AntunesFPS12,
author = {Luis Filipe Coelho Antunes and
Lance Fortnow and
Alexandre Pinto and
Andre Souto},
title = {Low-Depth Witnesses are Easy to Find},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {479--497},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0025-1},
doi = {10.1007/S00037-011-0025-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AntunesFPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-EliezerHL12,
author = {Ido Ben{-}Eliezer and
Rani Hod and
Shachar Lovett},
title = {Random low-degree polynomials are hard to approximate},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {63--81},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0020-6},
doi = {10.1007/S00037-011-0020-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Ben-EliezerHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-SassonV12,
author = {Eli Ben{-}Sasson and
Michael Viderman},
title = {Towards lower bounds on locally testable codes via density arguments},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {267--309},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0042-8},
doi = {10.1007/S00037-012-0042-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ben-SassonV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlaisBM12,
author = {Eric Blais and
Joshua Brody and
Kevin Matulef},
title = {Property Testing Lower Bounds via Communication Complexity},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {311--358},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0040-x},
doi = {10.1007/S00037-012-0040-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BlaisBM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlaserDF12,
author = {Markus Bl{\"{a}}ser and
Holger Dell and
Mahmoud Fouz},
title = {Complexity and Approximability of the Cover Polynomial},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {359--419},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0018-0},
doi = {10.1007/S00037-011-0018-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BlaserDF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlierT12,
author = {Hugue Blier and
Alain Tapp},
title = {A Quantum Characterization Of {NP}},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {499--510},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0016-2},
doi = {10.1007/S00037-011-0016-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BlierT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BogdanovQ12,
author = {Andrej Bogdanov and
Youming Qiao},
title = {On the security of Goldreich's one-way function},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {83--127},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0034-0},
doi = {10.1007/S00037-011-0034-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BogdanovQ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiLX12,
author = {Jin{-}Yi Cai and
Pinyan Lu and
Mingji Xia},
title = {Holographic reduction, interpolation and hardness},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {573--604},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0044-6},
doi = {10.1007/S00037-012-0044-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CaiLX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Drucker12,
author = {Andrew Drucker},
title = {Improved direct product theorems for randomized query complexity},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {197--244},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0043-7},
doi = {10.1007/S00037-012-0043-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Drucker12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Dvir12,
author = {Zeev Dvir},
title = {Extractors for varieties},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {515--572},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0023-3},
doi = {10.1007/S00037-011-0023-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Dvir12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldbergJ12,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Inapproximability of the Tutte polynomial of a planar graph},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {605--642},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0046-4},
doi = {10.1007/S00037-012-0046-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldbergJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichKNR12,
author = {Oded Goldreich and
Michael Krivelevich and
Ilan Newman and
Eyal Rozenberg},
title = {Hierarchy Theorems for Property Testing},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {129--192},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0022-4},
doi = {10.1007/S00037-011-0022-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichKNR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichV12,
author = {Oded Goldreich and
Salil P. Vadhan},
title = {Special issue from RANDOM'09: Editors' Foreword},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {1},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0035-z},
doi = {10.1007/S00037-011-0035-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KinneMS12,
author = {Jeff Kinne and
Dieter van Melkebeek and
Ronen Shaltiel},
title = {Pseudorandom Generators, Typically-Correct Derandomization, and Circuit
Lower Bounds},
journal = {Comput. Complex.},
volume = {21},
number = {1},
pages = {3--61},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0019-z},
doi = {10.1007/S00037-011-0019-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KinneMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LovettV12,
author = {Shachar Lovett and
Emanuele Viola},
title = {Bounded-Depth Circuits Cannot Sample Good Codes},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {245--266},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0039-3},
doi = {10.1007/S00037-012-0039-3},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/LovettV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PavanTV12,
author = {Aduri Pavan and
Raghunath Tewari and
N. V. Vinodchandran},
title = {On the power of unambiguity in log-space},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {643--670},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0047-3},
doi = {10.1007/S00037-012-0047-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PavanTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PomykalaZ12,
author = {Jacek Pomykala and
Bartosz Zralek},
title = {On reducing factorization to the discrete logarithm problem modulo
a composite},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {421--429},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0037-5},
doi = {10.1007/S00037-012-0037-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PomykalaZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Rao12,
author = {Anup Rao},
title = {Special Issue "Conference on Computational Complexity 2011" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {21},
number = {2},
pages = {193--195},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0041-9},
doi = {10.1007/S00037-012-0041-9},
timestamp = {Thu, 03 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Rao12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Wunderlich12,
author = {Henning Wunderlich},
title = {On a Theorem of Razborov},
journal = {Comput. Complex.},
volume = {21},
number = {3},
pages = {431--477},
year = {2012},
url = {https://doi.org/10.1007/s00037-011-0021-5},
doi = {10.1007/S00037-011-0021-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Wunderlich12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Alekhnovich11,
author = {Michael Alekhnovich},
title = {Lower Bounds for k-DNF Resolution on Random 3-CNFs},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {597--614},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0026-0},
doi = {10.1007/S00037-011-0026-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Alekhnovich11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Alekhnovich11a,
author = {Michael Alekhnovich},
title = {More on Average Case vs Approximation Complexity},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {755--786},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0029-x},
doi = {10.1007/S00037-011-0029-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Alekhnovich11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichAT11,
author = {Mikhail Alekhnovich and
Sanjeev Arora and
Iannis Tourlakis},
title = {Towards Strong Nonapproximability Results in the Lov{\'{a}}sz-Schrijver
Hierarchy},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {615--648},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0027-z},
doi = {10.1007/S00037-011-0027-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichAT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichBBIMP11,
author = {Michael Alekhnovich and
Allan Borodin and
Joshua Buresh{-}Oppenheim and
Russell Impagliazzo and
Avner Magen and
Toniann Pitassi},
title = {Toward a Model for Backtracking and Dynamic Programming},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {679--740},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0028-y},
doi = {10.1007/S00037-011-0028-Y},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichBBIMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichKKV11,
author = {Mikhail Alekhnovich and
Subhash Khot and
Guy Kindler and
Nisheeth K. Vishnoi},
title = {Hardness of Approximating the Closest Vector Problem with Pre-Processing},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {741--753},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0031-3},
doi = {10.1007/S00037-011-0031-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichKKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlekhnovichR11,
author = {Michael Alekhnovich and
Alexander A. Razborov},
title = {Satisfiability, Branch-Width and Tseitin tautologies},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {649--678},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0033-1},
doi = {10.1007/S00037-011-0033-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlekhnovichR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AydinliogluGHK11,
author = {Baris Aydinlioglu and
Dan Gutfreund and
John M. Hitchcock and
Akinori Kawachi},
title = {Derandomizing Arthur-Merlin Games and Approximate Counting Implies
Exponential-Size Lower Bounds},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {329--366},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0010-8},
doi = {10.1007/S00037-011-0010-8},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AydinliogluGHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BorodinPR11,
author = {Allan Borodin and
Toniann Pitassi and
Alexander A. Razborov},
title = {Special Issue In Memory of Misha Alekhnovich. Foreword},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {579--590},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0032-2},
doi = {10.1007/S00037-011-0032-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BorodinPR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChakaravarthyR11,
author = {Venkatesan T. Chakaravarthy and
Sambuddha Roy},
title = {Arthur and Merlin as Oracles},
journal = {Comput. Complex.},
volume = {20},
number = {3},
pages = {505--558},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0015-3},
doi = {10.1007/S00037-011-0015-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChakaravarthyR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DantchevMS11,
author = {Stefan S. Dantchev and
Barnaby Martin and
Stefan Szeider},
title = {Parameterized Proof Complexity},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {51--85},
year = {2011},
url = {https://doi.org/10.1007/s00037-010-0001-1},
doi = {10.1007/S00037-010-0001-1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DantchevMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DinurFKRS11,
author = {Irit Dinur and
Eldar Fischer and
Guy Kindler and
Ran Raz and
Shmuel Safra},
title = {{PCP} Characterizations of {NP:} Toward a Polynomially-Small Error-Probability},
journal = {Comput. Complex.},
volume = {20},
number = {3},
pages = {413--504},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0014-4},
doi = {10.1007/S00037-011-0014-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DinurFKRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DinurM11,
author = {Irit Dinur and
Or Meir},
title = {Derandomized Parallel Repetition via Structured PCPs},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {207--327},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0013-5},
doi = {10.1007/S00037-011-0013-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DinurM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Dvir11,
author = {Zeev Dvir},
title = {On Matrix Rigidity and Locally Self-correctable Codes},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {367--388},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0009-1},
doi = {10.1007/S00037-011-0009-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Dvir11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HrubesY11,
author = {Pavel Hrubes and
Amir Yehudayoff},
title = {Homogeneous Formulas and Symmetric Polynomials},
journal = {Comput. Complex.},
volume = {20},
number = {3},
pages = {559--578},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0007-3},
doi = {10.1007/S00037-011-0007-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HrubesY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kambites11,
author = {Mark Kambites},
title = {Generic Complexity of Finitely Presented Monoids and Semigroups},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {21--50},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0005-5},
doi = {10.1007/S00037-011-0005-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kambites11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kane11,
author = {Daniel M. Kane},
title = {The Gaussian Surface Area and Noise Sensitivity of Degree-\emph{d}
Polynomial Threshold Functions},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {389--412},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0012-6},
doi = {10.1007/S00037-011-0012-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kane11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoiranP11,
author = {Pascal Koiran and
Sylvain Perifel},
title = {Interpolation in Valiant's Theory},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {1--20},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0002-8},
doi = {10.1007/S00037-011-0002-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KoiranP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kolla11,
author = {Alexandra Kolla},
title = {Spectral Algorithms for Unique Games},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {177--206},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0011-7},
doi = {10.1007/S00037-011-0011-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kolla11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LuTW11,
author = {Chi{-}Jen Lu and
Shi{-}Chun Tsai and
Hsin{-}Lung Wu},
title = {Complexity of Hard-Core Set Proofs},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {145--171},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0003-7},
doi = {10.1007/S00037-011-0003-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LuTW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Melkebeek11,
author = {Dieter van Melkebeek},
title = {Special Issue "Conference on Computational Complexity 2010" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {20},
number = {2},
pages = {173--175},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0008-2},
doi = {10.1007/S00037-011-0008-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Melkebeek11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/NalskyO11,
author = {Max Nalsky and
Michael Ostrovsky},
title = {Obituary},
journal = {Comput. Complex.},
volume = {20},
number = {4},
pages = {591--595},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0030-4},
doi = {10.1007/S00037-011-0030-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/NalskyO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shaltiel11,
author = {Ronen Shaltiel},
title = {Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's
Lemma},
journal = {Comput. Complex.},
volume = {20},
number = {1},
pages = {87--143},
year = {2011},
url = {https://doi.org/10.1007/s00037-011-0006-4},
doi = {10.1007/S00037-011-0006-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shaltiel11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Amano10,
author = {Kazuyuki Amano},
title = {\emph{k}-Subgraph Isomorphism on AC\({}^{\mbox{0}}\) Circuits},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {183--210},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0288-y},
doi = {10.1007/S00037-010-0288-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Amano10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArvindMS10,
author = {Vikraman Arvind and
Partha Mukhopadhyay and
Srikanth Srinivasan},
title = {New Results on Noncommutative and Commutative Polynomial Identity
Testing},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {521--558},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0299-8},
doi = {10.1007/S00037-010-0299-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ArvindMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ArvindV10,
author = {Vikraman Arvind and
T. C. Vijayaraghavan},
title = {Classifying Problems on Linear Congruences and Abelian Permutation
Groups Using Logspace Counting Classes},
journal = {Comput. Complex.},
volume = {19},
number = {1},
pages = {57--98},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0280-6},
doi = {10.1007/S00037-009-0280-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ArvindV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-SassonI10,
author = {Eli Ben{-}Sasson and
Russell Impagliazzo},
title = {Random Cnf's are Hard for the Polynomial Calculus},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {501--519},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0293-1},
doi = {10.1007/S00037-010-0293-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Ben-SassonI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BurgisserS10,
author = {Peter B{\"{u}}rgisser and
Peter Scheiblechner},
title = {Counting Irreducible Components of Complex Algebraic Varieties},
journal = {Comput. Complex.},
volume = {19},
number = {1},
pages = {1--35},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0283-3},
doi = {10.1007/S00037-009-0283-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BurgisserS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiCL10,
author = {Jin{-}yi Cai and
Xi Chen and
Dong Li},
title = {Quadratic Lower Bound for Permanent Vs. Determinant in any Characteristic},
journal = {Comput. Complex.},
volume = {19},
number = {1},
pages = {37--56},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0284-2},
doi = {10.1007/S00037-009-0284-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CaiCL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DyerGJ10,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {A Complexity Dichotomy For Hypergraph Partition Functions},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {605--633},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0300-6},
doi = {10.1007/S00037-010-0300-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DyerGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GiesbrechtR10,
author = {Mark Giesbrecht and
Daniel S. Roche},
title = {Interpolation of Shifted-Lacunary Polynomials},
journal = {Comput. Complex.},
volume = {19},
number = {3},
pages = {333--354},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0294-0},
doi = {10.1007/S00037-010-0294-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GiesbrechtR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichS10,
author = {Oded Goldreich and
Or Sheffet},
title = {On The Randomness Complexity of Property Testing},
journal = {Comput. Complex.},
volume = {19},
number = {1},
pages = {99--133},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0282-4},
doi = {10.1007/S00037-009-0282-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GopalanSL10,
author = {Parikshit Gopalan and
Amir Shpilka and
Shachar Lovett},
title = {The Complexity of Boolean Functions in Different Characteristics},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {235--263},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0290-4},
doi = {10.1007/S00037-010-0290-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GopalanSL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HansenK10,
author = {Kristoffer Arnsfelt Hansen and
Michal Kouck{\'{y}}},
title = {A New Characterization of ACC\({}^{\mbox{0}}\) and Probabilistic CC\({}^{\mbox{0}}\)},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {211--234},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0287-z},
doi = {10.1007/S00037-010-0287-Z},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HansenK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hastad10,
author = {Johan H{\aa}stad},
title = {Special Issue "Conference on Computational Complexity 2009" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {151--152},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0289-x},
doi = {10.1007/S00037-010-0289-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hastad10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HoangT10,
author = {Thanh Minh Hoang and
Thomas Thierauf},
title = {The Complexity of the Inertia},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {559--580},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0295-z},
doi = {10.1007/S00037-010-0295-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HoangT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KaltofenL10,
author = {Erich L. Kaltofen and
Mark Lavin},
title = {Efficiently Certifying Non-Integer Powers},
journal = {Comput. Complex.},
volume = {19},
number = {3},
pages = {355--366},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0297-x},
doi = {10.1007/S00037-010-0297-X},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KaltofenL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kawamura10,
author = {Akitoshi Kawamura},
title = {Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space
Complete},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {305--332},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0286-0},
doi = {10.1007/S00037-010-0286-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kawamura10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KinneM10,
author = {Jeff Kinne and
Dieter van Melkebeek},
title = {Space Hierarchy Results for Randomized and other Semantic Models},
journal = {Comput. Complex.},
volume = {19},
number = {3},
pages = {423--475},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0277-1},
doi = {10.1007/S00037-009-0277-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KinneM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KlivansS10,
author = {Adam R. Klivans and
Alexander A. Sherstov},
title = {Lower Bounds for Agnostic Learning via Approximate Rank},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {581--604},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0296-y},
doi = {10.1007/S00037-010-0296-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KlivansS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeonardosS10,
author = {Nikos Leonardos and
Michael E. Saks},
title = {Lower Bounds on the Randomized Communication Complexity of Read-Once
Functions},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {153--181},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0292-2},
doi = {10.1007/S00037-010-0292-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LeonardosS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Livne10,
author = {Noam Livne},
title = {All Natural NP-Complete Problems Have Average-Case Complete Versions},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {477--499},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0298-9},
doi = {10.1007/S00037-010-0298-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Livne10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MoshkovitzR10,
author = {Dana Moshkovitz and
Ran Raz},
title = {Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear
Size},
journal = {Comput. Complex.},
volume = {19},
number = {3},
pages = {367--422},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0278-0},
doi = {10.1007/S00037-009-0278-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MoshkovitzR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RothblumV10,
author = {Guy N. Rothblum and
Salil P. Vadhan},
title = {Are PCPs Inherent in Efficient Arguments?},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {265--304},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0291-3},
doi = {10.1007/S00037-010-0291-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/RothblumV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sherstov10,
author = {Alexander A. Sherstov},
title = {Communication Complexity Under Product and Nonproduct Distributions},
journal = {Comput. Complex.},
volume = {19},
number = {1},
pages = {135--150},
year = {2010},
url = {https://doi.org/10.1007/s00037-009-0285-1},
doi = {10.1007/S00037-009-0285-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sherstov10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AustrinM09,
author = {Per Austrin and
Elchanan Mossel},
title = {Approximation Resistant Predicates from Pairwise Independence},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {249--271},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0272-6},
doi = {10.1007/S00037-009-0272-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AustrinM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameC09,
author = {Paul Beame and
Amit Chakrabarti},
title = {Special Issue "Conference on Computational Complexity 2008" Guest
Editors' Foreword},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {169--170},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0271-7},
doi = {10.1007/S00037-009-0271-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelHN09,
author = {Amos Beimel and
Renen Hallak and
Kobbi Nissim},
title = {Private Approximation of Clustering and Vertex Cover},
journal = {Comput. Complex.},
volume = {18},
number = {3},
pages = {435--494},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0259-3},
doi = {10.1007/S00037-009-0259-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeimelHN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BravermanKR09,
author = {Mark Braverman and
Raghav Kulkarni and
Sambuddha Roy},
title = {Space-Efficient Counting in Graphs on Surfaces},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {601--649},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0266-4},
doi = {10.1007/S00037-009-0266-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BravermanKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BriandOR09,
author = {Emmanuel Briand and
Rosa C. Orellana and
Mercedes H. Rosas},
title = {Reduced Kronecker Coefficients and Counter-Examples to Mulmuley's
Strong Saturation Conjecture {SH}},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {577--600},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0279-z},
doi = {10.1007/S00037-009-0279-Z},
timestamp = {Tue, 26 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BriandOR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Burgisser09,
author = {Peter B{\"{u}}rgisser},
title = {On Defining Integers And Proving Arithmetic Circuit Lower Bounds},
journal = {Comput. Complex.},
volume = {18},
number = {1},
pages = {81--103},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0260-x},
doi = {10.1007/S00037-009-0260-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Burgisser09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CuckerN09,
author = {Felipe Cucker and
Paulin Jacob{\'{e}} de Naurois},
title = {Parallel Time and Quantifier Prefixes},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {527--550},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0264-6},
doi = {10.1007/S00037-009-0264-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CuckerN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DratmanMW09,
author = {Ezequiel Dratman and
Guillermo Matera and
Ariel Waissbein},
title = {Robust Algorithms For Generalized Pham Systems},
journal = {Comput. Complex.},
volume = {18},
number = {1},
pages = {105--154},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0268-2},
doi = {10.1007/S00037-009-0268-2},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DratmanMW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DvirGW09,
author = {Zeev Dvir and
Ariel Gabizon and
Avi Wigderson},
title = {Extractors And Rank Extractors For Polynomial Sources},
journal = {Comput. Complex.},
volume = {18},
number = {1},
pages = {1--58},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0258-4},
doi = {10.1007/S00037-009-0258-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DvirGW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hashemi09,
author = {Amir Hashemi},
title = {Nullstellens{\"{a}}tze for Zero-Dimensional Gr{\"{o}}bner
Bases},
journal = {Comput. Complex.},
volume = {18},
number = {1},
pages = {155--168},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0261-9},
doi = {10.1007/S00037-009-0261-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hashemi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hastad09,
author = {Johan H{\aa}stad},
title = {On the Approximation Resistance of a Random Predicate},
journal = {Comput. Complex.},
volume = {18},
number = {3},
pages = {413--434},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0262-8},
doi = {10.1007/S00037-009-0262-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hastad09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/JumaKRS09,
author = {Ali Juma and
Valentine Kabanets and
Charles Rackoff and
Amir Shpilka},
title = {The Black-Box Query Complexity of Polynomial Summation},
journal = {Comput. Complex.},
volume = {18},
number = {1},
pages = {59--79},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0263-7},
doi = {10.1007/S00037-009-0263-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/JumaKRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KempeKMV09,
author = {Julia Kempe and
Hirotada Kobayashi and
Keiji Matsumoto and
Thomas Vidick},
title = {Using Entanglement in Quantum Multi-Prover Interactive Proofs},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {273--307},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0275-3},
doi = {10.1007/S00037-009-0275-3},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KempeKMV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoiranP09,
author = {Pascal Koiran and
Sylvain Perifel},
title = {{VPSPACE} and a Transfer Theorem over the Reals},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {551--575},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0269-1},
doi = {10.1007/S00037-009-0269-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KoiranP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LeeS09,
author = {Troy Lee and
Adi Shraibman},
title = {Disjointness is Hard in the Multiparty Number-on-the-Forehead Model},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {309--336},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0276-2},
doi = {10.1007/S00037-009-0276-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LeeS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LimayeMS09,
author = {Nutan Limaye and
Meena Mahajan and
Jayalal Sarma},
title = {Upper Bounds for Monotone Planar Circuit Value and Variants},
journal = {Comput. Complex.},
volume = {18},
number = {3},
pages = {377--412},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0265-5},
doi = {10.1007/S00037-009-0265-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LimayeMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazY09,
author = {Ran Raz and
Amir Yehudayoff},
title = {Lower Bounds and Separations for Constant Depth Multilinear Circuits},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {171--207},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0270-8},
doi = {10.1007/S00037-009-0270-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sherstov09,
author = {Alexander A. Sherstov},
title = {Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {219--247},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0274-4},
doi = {10.1007/S00037-009-0274-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sherstov09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shpilka09,
author = {Amir Shpilka},
title = {Constructions of Low-degree and Error-Correcting epsilon-Biased Generators},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {495--525},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0281-5},
doi = {10.1007/S00037-009-0281-5},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Shpilka09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Viola09,
author = {Emanuele Viola},
title = {The Sum of \emph{D} Small-Bias Generators Fools Polynomials of Degree
\emph{D}},
journal = {Comput. Complex.},
volume = {18},
number = {2},
pages = {209--217},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0273-5},
doi = {10.1007/S00037-009-0273-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Viola09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Viola09a,
author = {Emanuele Viola},
title = {On Approximate Majority and Probabilistic Time},
journal = {Comput. Complex.},
volume = {18},
number = {3},
pages = {337--375},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0267-3},
doi = {10.1007/S00037-009-0267-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Viola09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ApplebaumIK08,
author = {Benny Applebaum and
Yuval Ishai and
Eyal Kushilevitz},
title = {On Pseudorandom Generators with Linear Stretch in NC\({}^{\mbox{0}}\)},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {38--69},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0237-6},
doi = {10.1007/S00037-007-0237-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumIK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BasuBGL08,
author = {Saugata Basu and
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Polynomials that Sign Represent Parity and Descartes' Rule of Signs},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {377--406},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0244-2},
doi = {10.1007/S00037-008-0244-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BasuBGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CaiL08,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {Basis Collapse in Holographic Algorithms},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {254--281},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0249-x},
doi = {10.1007/S00037-008-0249-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/CaiL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Chen08,
author = {Hubie Chen},
title = {Inverse {NP} Problems},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {94--118},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0240-6},
doi = {10.1007/S00037-008-0240-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Chen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CleveSUU08,
author = {Richard Cleve and
William Slofstra and
Falk Unger and
Sarvagya Upadhyay},
title = {Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {282--299},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0250-4},
doi = {10.1007/S00037-008-0250-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CleveSUU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FortnowIKU08,
author = {Lance Fortnow and
Russell Impagliazzo and
Valentine Kabanets and
Christopher Umans},
title = {On the Complexity of Succinct Zero-Sum Games},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {353--376},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0252-2},
doi = {10.1007/S00037-008-0252-2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/FortnowIKU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Goldreich08,
author = {Oded Goldreich},
title = {Preface to the Special Issue from Random'06},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {1--2},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0236-7},
doi = {10.1007/S00037-007-0236-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Goldreich08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grigoriev08,
author = {Dima Grigoriev},
title = {Probabilistic Communication Complexity Over The Reals},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {536--548},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0255-z},
doi = {10.1007/S00037-008-0255-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grigoriev08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuL08,
author = {Xiaoyang Gu and
Jack H. Lutz},
title = {Dimension Characterizations of Complexity Classes},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {459--474},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0257-x},
doi = {10.1007/S00037-008-0257-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiK08,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Hardness Amplification via Space-Efficient Direct Products},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {475--500},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0253-1},
doi = {10.1007/S00037-008-0253-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hastad08,
author = {Johan H{\aa}stad},
title = {Every 2-csp Allows Nontrivial Approximation},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {549--566},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0256-y},
doi = {10.1007/S00037-008-0256-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hastad08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Healy08,
author = {Alexander Healy},
title = {Randomness-Efficient Sampling within NC\({}^{\mbox{1}}\)},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {3--37},
year = {2008},
url = {https://doi.org/10.1007/s00037-007-0238-5},
doi = {10.1007/S00037-007-0238-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Healy08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HitchcockP08,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Hardness Hypotheses, Derandomization, and Circuit Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {119--146},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0241-5},
doi = {10.1007/S00037-008-0241-5},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HitchcockP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LachishNS08,
author = {Oded Lachish and
Ilan Newman and
Asaf Shapira},
title = {Space Complexity Vs. Query Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {70--93},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0239-z},
doi = {10.1007/S00037-008-0239-Z},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/LachishNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Miltersen08,
author = {Peter Bro Miltersen},
title = {Special Issue: "Conference on Computational Complexity 2007" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {147--148},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0247-z},
doi = {10.1007/S00037-008-0247-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Miltersen08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PavanV08,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {2-Local Random Reductions to 3-Valued Functions},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {501--514},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0245-1},
doi = {10.1007/S00037-008-0245-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PavanV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Peikert08,
author = {Chris Peikert},
title = {Limits on the Hardness of Lattice Problems in \emph{l}\({}_{\mbox{\emph{p}}}\)
Norms},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {300--351},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0251-3},
doi = {10.1007/S00037-008-0251-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Peikert08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazT08,
author = {Ran Raz and
Iddo Tzameret},
title = {The Strength of Multilinear Proofs},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {407--457},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0246-0},
doi = {10.1007/S00037-008-0246-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazY08,
author = {Ran Raz and
Amir Yehudayoff},
title = {Balancing Syntactically Multilinear Arithmetic Circuits},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {515--535},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0254-0},
doi = {10.1007/S00037-008-0254-0},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sherstov08,
author = {Alexander A. Sherstov},
title = {Halfspace Matrices},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {149--178},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0242-4},
doi = {10.1007/S00037-008-0242-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sherstov08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Williams08,
author = {R. Ryan Williams},
title = {Time-Space Tradeoffs for Counting {NP} Solutions Modulo Integers},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {179--219},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0248-y},
doi = {10.1007/S00037-008-0248-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Williams08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Zimand08,
author = {Marius Zimand},
title = {Exposure-Resilient Extractors and the Derandomization of Probabilistic
Sublinear Time},
journal = {Comput. Complex.},
volume = {17},
number = {2},
pages = {220--253},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0243-3},
doi = {10.1007/S00037-008-0243-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Zimand08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameIS07,
author = {Paul Beame and
Russell Impagliazzo and
Ashish Sabharwal},
title = {The Resolution Complexity of Independent Sets and Vertex Covers in
Random Graphs},
journal = {Comput. Complex.},
volume = {16},
number = {3},
pages = {245--297},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0230-0},
doi = {10.1007/S00037-007-0230-0},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameIS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeaudryH07,
author = {Martin Beaudry and
Markus Holzer},
title = {The Complexity of Tensor Circuit Evaluation},
journal = {Comput. Complex.},
volume = {16},
number = {1},
pages = {60--111},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0222-0},
doi = {10.1007/S00037-007-0222-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeaudryH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DvirS07,
author = {Zeev Dvir and
Amir Shpilka},
title = {An Improved Analysis of Linear Mergers},
journal = {Comput. Complex.},
volume = {16},
number = {1},
pages = {34--59},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0223-z},
doi = {10.1007/S00037-007-0223-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DvirS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichV07,
author = {Oded Goldreich and
Salil P. Vadhan},
title = {Special Issue On Worst-case Versus Average-case Complexity Editors'
Foreword},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {325--330},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0232-y},
doi = {10.1007/S00037-007-0232-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiK07,
author = {Venkatesan Guruswami and
Valentine Kabanets},
title = {Special Issue "Conference on Computational Complexity 2006" Guest
Editors' Foreword},
journal = {Comput. Complex.},
volume = {16},
number = {2},
pages = {113--114},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0225-x},
doi = {10.1007/S00037-007-0225-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GutfreundST07,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {If {NP} Languages are Hard on the Worst-Case, Then it is Easy to Find
Their Hard Instances},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {412--441},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0235-8},
doi = {10.1007/S00037-007-0235-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GutfreundST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HarshaIKNV07,
author = {Prahladh Harsha and
Yuval Ishai and
Joe Kilian and
Kobbi Nissim and
Srinivasan Venkatesh},
title = {Communication vs. Computation},
journal = {Comput. Complex.},
volume = {16},
number = {1},
pages = {1--33},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0224-y},
doi = {10.1007/S00037-007-0224-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HarshaIKNV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KayalS07,
author = {Neeraj Kayal and
Nitin Saxena},
title = {Polynomial Identity Testing for Depth 3 Circuits},
journal = {Comput. Complex.},
volume = {16},
number = {2},
pages = {115--138},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0226-9},
doi = {10.1007/S00037-007-0226-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KayalS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/McKenzieW07,
author = {Pierre McKenzie and
Klaus W. Wagner},
title = {The Complexity of Membership Problems for Circuits Over Sets of Natural
Numbers},
journal = {Comput. Complex.},
volume = {16},
number = {3},
pages = {211--244},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0229-6},
doi = {10.1007/S00037-007-0229-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/McKenzieW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MelkebeekP07,
author = {Dieter van Melkebeek and
Konstantin Pervyshev},
title = {A Generic Time Hierarchy with One Bit of Advice},
journal = {Comput. Complex.},
volume = {16},
number = {2},
pages = {139--179},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0227-8},
doi = {10.1007/S00037-007-0227-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MelkebeekP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Micciancio07,
author = {Daniele Micciancio},
title = {Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way
Functions},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {365--411},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0234-9},
doi = {10.1007/S00037-007-0234-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Micciancio07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Servedio07,
author = {Rocco A. Servedio},
title = {Every Linear Threshold Function has a Low-Weight Approximator},
journal = {Comput. Complex.},
volume = {16},
number = {2},
pages = {180--209},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0228-7},
doi = {10.1007/S00037-007-0228-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Servedio07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TrevisanV07,
author = {Luca Trevisan and
Salil P. Vadhan},
title = {Pseudorandomness and Average-Case Complexity Via Uniform Reductions},
journal = {Comput. Complex.},
volume = {16},
number = {4},
pages = {331--364},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0233-x},
doi = {10.1007/S00037-007-0233-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TrevisanV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/WegenerW07,
author = {Ingo Wegener and
Philipp Woelfel},
title = {New Results on the Complexity of the Middle Bit of Multiplication},
journal = {Comput. Complex.},
volume = {16},
number = {3},
pages = {298--323},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0231-z},
doi = {10.1007/S00037-007-0231-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/WegenerW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ApplebaumIK06,
author = {Benny Applebaum and
Yuval Ishai and
Eyal Kushilevitz},
title = {Computationally Private Randomizing Polynomials and Their Applications},
journal = {Comput. Complex.},
volume = {15},
number = {2},
pages = {115--162},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0211-8},
doi = {10.1007/S00037-006-0211-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ApplebaumIK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Basu06,
author = {Saugata Basu},
title = {Efficient algorithm for computing the Euler-Poincar{\'{e}} characteristic
of a semi-algebraic set defined by few quadratic inequalities},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {236--251},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0214-5},
doi = {10.1007/S00037-006-0214-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Basu06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeamePSW06,
author = {Paul Beame and
Toniann Pitassi and
Nathan Segerlind and
Avi Wigderson},
title = {A Strong Direct Product Theorem for Corruption and the Multiparty
Communication Complexity of Disjointness},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {391--432},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0220-2},
doi = {10.1007/S00037-007-0220-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeamePSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelFG06,
author = {Richard Beigel and
Lance Fortnow and
William I. Gasarch},
title = {A tight lower bound for restricted pir protocols},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {82--91},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0208-3},
doi = {10.1007/S00037-006-0208-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelFG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyK06,
author = {Nader H. Bshouty and
Michael Kaminski},
title = {Polynomial multiplication over finite fields: from quadratic to straight-line
complexity},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {252--262},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0215-4},
doi = {10.1007/S00037-006-0215-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BurgisserCN06,
author = {Peter B{\"{u}}rgisser and
Felipe Cucker and
Paulin Jacob{\'{e}} de Naurois},
title = {The complexity of semilinear problems in succinct representation},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {197--235},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0213-6},
doi = {10.1007/S00037-006-0213-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BurgisserCN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChawlaKKRS06,
author = {Shuchi Chawla and
Robert Krauthgamer and
Ravi Kumar and
Yuval Rabani and
D. Sivakumar},
title = {On the Hardness of Approximating Multicut and Sparsest-Cut},
journal = {Comput. Complex.},
volume = {15},
number = {2},
pages = {94--114},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0210-9},
doi = {10.1007/S00037-006-0210-9},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ChawlaKKRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Gal06,
author = {Anna G{\'{a}}l},
title = {Special Issue "Conference on Computational Complexity 2005" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {15},
number = {2},
pages = {93},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0209-2},
doi = {10.1007/S00037-006-0209-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Gal06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Gal06a,
author = {Anna G{\'{a}}l},
title = {Special Issue "Conference on Computational Complexity 2005" Guest
Editor's Foreword},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {297},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0217-x},
doi = {10.1007/S00037-007-0217-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Gal06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichKST06,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower bounds for linear locally decodable codes and private information
retrieval},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {263--296},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0216-3},
doi = {10.1007/S00037-006-0216-3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichKST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HansenMV06,
author = {Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
V. Vinay},
title = {Circuits on cylinders},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {62--81},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0207-4},
doi = {10.1007/S00037-006-0207-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HansenMV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HazanSS06,
author = {Elad Hazan and
Shmuel Safra and
Oded Schwartz},
title = {On the complexity of approximating \emph{k}-set packing},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {20--39},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0205-6},
doi = {10.1007/S00037-006-0205-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HazanSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KaraK06,
author = {Jan K{\'{a}}ra and
Daniel Kr{\'{a}}l},
title = {Free binary decision diagrams for the computation of EAR\({}_{\mbox{\emph{n}}}\)},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {40--61},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0206-5},
doi = {10.1007/S00037-006-0206-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KaraK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KayalS06,
author = {Neeraj Kayal and
Nitin Saxena},
title = {Complexity of Ring Morphism Problems},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {342--390},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0219-8},
doi = {10.1007/S00037-007-0219-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KayalS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kedlaya06,
author = {Kiran S. Kedlaya},
title = {Quantum computation of zeta functions of curves},
journal = {Comput. Complex.},
volume = {15},
number = {1},
pages = {1--19},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0204-7},
doi = {10.1007/S00037-006-0204-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kedlaya06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Krause06,
author = {Matthias Krause},
title = {On the computational power of Boolean decision lists},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {362--375},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0203-0},
doi = {10.1007/S00037-005-0203-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Krause06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LaplanteLS06,
author = {Sophie Laplante and
Troy Lee and
Mario Szegedy},
title = {The Quantum Adversary Method and Classical Formula Size Lower Bounds},
journal = {Comput. Complex.},
volume = {15},
number = {2},
pages = {163--196},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0212-7},
doi = {10.1007/S00037-006-0212-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LaplanteLS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Marx06,
author = {D{\'{a}}niel Marx},
title = {The complexity of chromatic strength and chromatic edge strength},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {308--340},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0201-2},
doi = {10.1007/S00037-005-0201-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Marx06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Pollett06,
author = {Chris Pollett},
title = {Languages to diagonalize against advice classes},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {341--361},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0202-1},
doi = {10.1007/S00037-005-0202-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Pollett06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SafraS06,
author = {Shmuel Safra and
Oded Schwartz},
title = {On the complexity of approximating tsp with neighborhoods and related
problems},
journal = {Comput. Complex.},
volume = {14},
number = {4},
pages = {281--307},
year = {2006},
url = {https://doi.org/10.1007/s00037-005-0200-3},
doi = {10.1007/S00037-005-0200-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/SafraS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShaltielU06,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Pseudorandomness for Approximate Counting and Sampling},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {298--341},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0218-9},
doi = {10.1007/S00037-007-0218-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ShaltielU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Williams06,
author = {Ryan Williams},
title = {Inductive Time-Space Lower Bounds for Sat and Related Problems},
journal = {Comput. Complex.},
volume = {15},
number = {4},
pages = {433--470},
year = {2006},
url = {https://doi.org/10.1007/s00037-007-0221-1},
doi = {10.1007/S00037-007-0221-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Williams06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Allender05,
author = {Eric Allender},
title = {Special issue "Conference on Computational Complexity 2004" Guest
Editor's foreword},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {89},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0192-z},
doi = {10.1007/S00037-005-0192-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Allender05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Allender05a,
author = {Eric Allender},
title = {Special issue, final part "Conference on \emph{Computational Complexity}
2004 " Guest Editor's foreword},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {185},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0196-8},
doi = {10.1007/S00037-005-0196-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Allender05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BasuPR05,
author = {Saugata Basu and
Richard Pollack and
Marie{-}Fran{\c{c}}oise Roy},
title = {Computing the euler-poincar{\'{e}} characteristics of sign conditions},
journal = {Comput. Complex.},
volume = {14},
number = {1},
pages = {53--71},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0190-1},
doi = {10.1007/S00037-005-0190-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BasuPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanLM05,
author = {Harry Buhrman and
Troy Lee and
Dieter van Melkebeek},
title = {Language compression and pseudorandom generators},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {228--255},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0199-5},
doi = {10.1007/S00037-005-0199-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorievP05,
author = {Dima Grigoriev and
Dmitrii V. Pasechnik},
title = {Polynomial-time computing over quadratic maps i: sampling in real
algebraic sets},
journal = {Comput. Complex.},
volume = {14},
number = {1},
pages = {20--52},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0189-7},
doi = {10.1007/S00037-005-0189-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigorievP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuruswamiMR05,
author = {Venkatesan Guruswami and
Daniele Micciancio and
Oded Regev},
title = {The complexity of the covering radius problem},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {90--121},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0193-y},
doi = {10.1007/S00037-005-0193-Y},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuruswamiMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KaltofenV05,
author = {Erich L. Kaltofen and
Gilles Villard},
title = {On the complexity of computing determinants},
journal = {Comput. Complex.},
volume = {13},
number = {3-4},
pages = {91--130},
year = {2005},
url = {https://doi.org/10.1007/s00037-004-0185-3},
doi = {10.1007/S00037-004-0185-3},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KaltofenV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Koiran05,
author = {Pascal Koiran},
title = {Valiant's model and the cost of computing integers},
journal = {Comput. Complex.},
volume = {13},
number = {3-4},
pages = {131--146},
year = {2005},
url = {https://doi.org/10.1007/s00037-004-0186-2},
doi = {10.1007/S00037-004-0186-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Koiran05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kristiansen05,
author = {Lars Kristiansen},
title = {Neat function algebraic characterizations of logspace and linspace},
journal = {Comput. Complex.},
volume = {14},
number = {1},
pages = {72--88},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0191-0},
doi = {10.1007/S00037-005-0191-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kristiansen05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MarriottW05,
author = {Chris Marriott and
John Watrous},
title = {Quantum Arthur-Merlin games},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {122--152},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0194-x},
doi = {10.1007/S00037-005-0194-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MarriottW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Marx05,
author = {D{\'{a}}niel Marx},
title = {Parameterized complexity of constraint satisfaction problems},
journal = {Comput. Complex.},
volume = {14},
number = {2},
pages = {153--183},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0195-9},
doi = {10.1007/S00037-005-0195-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Marx05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MiltersenV05,
author = {Peter Bro Miltersen and
N. V. Vinodchandran},
title = {Derandomizing Arthur-Merlin Games using Hitting Sets},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {256--279},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0197-7},
doi = {10.1007/S00037-005-0197-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MiltersenV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazS05,
author = {Ran Raz and
Amir Shpilka},
title = {Deterministic polynomial identity testing in non-commutative models},
journal = {Comput. Complex.},
volume = {14},
number = {1},
pages = {1--19},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0188-8},
doi = {10.1007/S00037-005-0188-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/RazS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TrevisanVZ05,
author = {Luca Trevisan and
Salil P. Vadhan and
David Zuckerman},
title = {Compression of Samplable Sources},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {186--227},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0198-6},
doi = {10.1007/S00037-005-0198-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TrevisanVZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Viola05,
author = {Emanuele Viola},
title = {The complexity of constructing pseudorandom generators from hard functions},
journal = {Comput. Complex.},
volume = {13},
number = {3-4},
pages = {147--188},
year = {2005},
url = {https://doi.org/10.1007/s00037-004-0187-1},
doi = {10.1007/S00037-004-0187-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Viola05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BonetDGMP04,
author = {Maria Luisa Bonet and
Carlos Domingo and
Ricard Gavald{\`{a}} and
Alexis Maciel and
Toniann Pitassi},
title = {Non-Automatizability of Bounded-Depth Frege Proofs},
journal = {Comput. Complex.},
volume = {13},
number = {1-2},
pages = {47--68},
year = {2004},
url = {https://doi.org/10.1007/s00037-004-0183-5},
doi = {10.1007/S00037-004-0183-5},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BonetDGMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KabanetsI04,
author = {Valentine Kabanets and
Russell Impagliazzo},
title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower
Bounds},
journal = {Comput. Complex.},
volume = {13},
number = {1-2},
pages = {1--46},
year = {2004},
url = {https://doi.org/10.1007/s00037-004-0182-6},
doi = {10.1007/S00037-004-0182-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KabanetsI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kuroda04,
author = {Satoru Kuroda},
title = {Recursion Schemata for Slowly Growing Depth Circuit Classes},
journal = {Comput. Complex.},
volume = {13},
number = {1-2},
pages = {69--89},
year = {2004},
url = {https://doi.org/10.1007/s00037-004-0184-4},
doi = {10.1007/S00037-004-0184-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kuroda04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderBDGSS03,
author = {Eric Allender and
Anna Bernasconi and
Carsten Damm and
Joachim von zur Gathen and
Michael E. Saks and
Igor E. Shparlinski},
title = {Complexity of some arithmetic problems for binary polynomials},
journal = {Comput. Complex.},
volume = {12},
number = {1-2},
pages = {23--47},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0176-9},
doi = {10.1007/S00037-003-0176-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AllenderBDGSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Bley03,
author = {Andreas Bley},
title = {On the complexity of vertex-disjoint length-restricted path problems},
journal = {Comput. Complex.},
volume = {12},
number = {3-4},
pages = {131--149},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0179-6},
doi = {10.1007/S00037-003-0179-6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Bley03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Cheng03,
author = {Qi Cheng},
title = {Straight-line programs and torsion points on elliptic curves},
journal = {Comput. Complex.},
volume = {12},
number = {3-4},
pages = {150--161},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0180-0},
doi = {10.1007/S00037-003-0180-0},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Cheng03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GutfreundST03,
author = {Dan Gutfreund and
Ronen Shaltiel and
Amnon Ta{-}Shma},
title = {Uniform hardness versus randomness tradeoffs for Arthur-Merlin games},
journal = {Comput. Complex.},
volume = {12},
number = {3-4},
pages = {85--130},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0178-7},
doi = {10.1007/S00037-003-0178-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GutfreundST03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MiharaS03,
author = {Takashi Mihara and
Shao Chin Sung},
title = {Deterministic polynomial-time quantum algorithms for Simon's problem},
journal = {Comput. Complex.},
volume = {12},
number = {3-4},
pages = {162--175},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0181-z},
doi = {10.1007/S00037-003-0181-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MiharaS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shaltiel03,
author = {Ronen Shaltiel},
title = {Towards proving strong direct product theorems},
journal = {Comput. Complex.},
volume = {12},
number = {1-2},
pages = {1--22},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0175-x},
doi = {10.1007/S00037-003-0175-X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shaltiel03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Watrous03,
author = {John Watrous},
title = {On the complexity of simulating space-bounded quantum computations},
journal = {Comput. Complex.},
volume = {12},
number = {1-2},
pages = {48--84},
year = {2003},
url = {https://doi.org/10.1007/s00037-003-0177-8},
doi = {10.1007/S00037-003-0177-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Watrous03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ben-Sasson02,
author = {Eli Ben{-}Sasson},
title = {Hard examples for the bounded depth Frege proof system},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {109--136},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0172-5},
doi = {10.1007/S00037-002-0172-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ben-Sasson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Buresh-OppenheimCIP02,
author = {Josh Buresh{-}Oppenheim and
Matthew Clegg and
Russell Impagliazzo and
Toniann Pitassi},
title = {Homogenization and the polynomial calculus},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {91--108},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0171-6},
doi = {10.1007/S00037-002-0171-6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Buresh-OppenheimCIP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CodenottiSW02,
author = {Bruno Codenotti and
Igor E. Shparlinski and
Arne Winterhof},
title = {On the hardness of approximating the permanent of structured matrices},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {158--170},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0174-3},
doi = {10.1007/S00037-002-0174-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CodenottiSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DammHM02,
author = {Carsten Damm and
Markus Holzer and
Pierre McKenzie},
title = {The complexity of tensor calculus},
journal = {Comput. Complex.},
volume = {11},
number = {1-2},
pages = {54--89},
year = {2002},
url = {https://doi.org/10.1007/s00037-000-0170-4},
doi = {10.1007/S00037-000-0170-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DammHM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FortnowR02,
author = {Lance Fortnow and
John D. Rogers},
title = {Separability and one-way functions},
journal = {Comput. Complex.},
volume = {11},
number = {3-4},
pages = {137--157},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0173-4},
doi = {10.1007/S00037-002-0173-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FortnowR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichVW02,
author = {Oded Goldreich and
Salil P. Vadhan and
Avi Wigderson},
title = {On interactive proofs with a laconic prover},
journal = {Comput. Complex.},
volume = {11},
number = {1-2},
pages = {1--53},
year = {2002},
url = {https://doi.org/10.1007/s00037-002-0169-0},
doi = {10.1007/S00037-002-0169-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AgrawalAIPR01,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
title = {Reducing the complexity of reductions},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {117--138},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8191-1},
doi = {10.1007/S00037-001-8191-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AgrawalAIPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BonetG01,
author = {Maria Luisa Bonet and
Nicola Galesi},
title = {Optimality of size-width tradeoffs for resolution},
journal = {Comput. Complex.},
volume = {10},
number = {4},
pages = {261--276},
year = {2001},
url = {https://doi.org/10.1007/s000370100000},
doi = {10.1007/S000370100000},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BonetG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanFFT01,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow and
Leen Torenvliet},
title = {Two oracles that force a big crunch},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {93--116},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8190-2},
doi = {10.1007/S00037-001-8190-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanFFT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChocklerZ01,
author = {Hana Chockler and
Uri Zwick},
title = {Which bases admit non-trivial shrinkage of formulae?},
journal = {Comput. Complex.},
volume = {10},
number = {1},
pages = {28--40},
year = {2001},
url = {https://doi.org/10.1007/PL00001610},
doi = {10.1007/PL00001610},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChocklerZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/EdmondsIRS01,
author = {Jeff Edmonds and
Russell Impagliazzo and
Steven Rudich and
Jir{\'{\i}} Sgall},
title = {Communication complexity towards lower bounds on circuit depth},
journal = {Comput. Complex.},
volume = {10},
number = {3},
pages = {210--246},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8195-x},
doi = {10.1007/S00037-001-8195-X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/EdmondsIRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Gal01,
author = {Anna G{\'{a}}l},
title = {A characterization of span program size and improved lower bounds
for monotone span programs},
journal = {Comput. Complex.},
volume = {10},
number = {4},
pages = {277--296},
year = {2001},
url = {https://doi.org/10.1007/s000370100001},
doi = {10.1007/S000370100001},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Gal01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Giesbrecht01,
author = {Mark Giesbrecht},
title = {Fast computation of the Smith form of a sparse integer matrix},
journal = {Comput. Complex.},
volume = {10},
number = {1},
pages = {41--69},
year = {2001},
url = {https://doi.org/10.1007/PL00001611},
doi = {10.1007/PL00001611},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Giesbrecht01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grigoriev01,
author = {Dima Grigoriev},
title = {Complexity of Positivstellensatz proofs for the knapsack},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {139--154},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8192-0},
doi = {10.1007/S00037-001-8192-0},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grigoriev01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KrauseL01,
author = {Matthias Krause and
Stefan Lucks},
title = {Pseudorandom functions in TC\({}^{\mbox{0}}\) and cryptographic limitations
to proving lower bounds},
journal = {Comput. Complex.},
volume = {10},
number = {4},
pages = {297--313},
year = {2001},
url = {https://doi.org/10.1007/s000370100002},
doi = {10.1007/S000370100002},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KrauseL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KremerNR01,
author = {Ilan Kremer and
Noam Nisan and
Dana Ron},
title = {Errata for: "On randomized one-round communication complexity"},
journal = {Comput. Complex.},
volume = {10},
number = {4},
pages = {314--315},
year = {2001},
url = {https://doi.org/10.1007/s000370100003},
doi = {10.1007/S000370100003},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KremerNR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Lu01,
author = {Chi{-}Jen Lu},
title = {Derandomizing Arthur-Merlin games under uniform assumptions},
journal = {Comput. Complex.},
volume = {10},
number = {3},
pages = {247--259},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8196-9},
doi = {10.1007/S00037-001-8196-9},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Lu01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MeinelW01,
author = {Christoph Meinel and
Stephan Waack},
title = {The "log rank" conjecture for modular communication complexity},
journal = {Comput. Complex.},
volume = {10},
number = {1},
pages = {70--91},
year = {2001},
url = {https://doi.org/10.1007/PL00001612},
doi = {10.1007/PL00001612},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/MeinelW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Riis01,
author = {S{\o}ren Riis},
title = {A complexity gap for tree resolution},
journal = {Comput. Complex.},
volume = {10},
number = {3},
pages = {179--209},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8194-y},
doi = {10.1007/S00037-001-8194-Y},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Riis01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sauerhoff01,
author = {Martin Sauerhoff},
title = {On the size of randomized OBDDs and read-once branching programs for
k-stable functions},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {155--178},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8193-z},
doi = {10.1007/S00037-001-8193-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sauerhoff01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShpilkaW01,
author = {Amir Shpilka and
Avi Wigderson},
title = {Depth-3 arithmetic circuits over fields of characteristic zero},
journal = {Comput. Complex.},
volume = {10},
number = {1},
pages = {1--27},
year = {2001},
url = {https://doi.org/10.1007/PL00001609},
doi = {10.1007/PL00001609},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ShpilkaW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlvarezG00,
author = {Carme {\`{A}}lvarez and
Raymond Greenlaw},
title = {A compendium of problems complete for symmetric logarithmic space},
journal = {Comput. Complex.},
volume = {9},
number = {2},
pages = {123--145},
year = {2000},
url = {https://doi.org/10.1007/PL00001603},
doi = {10.1007/PL00001603},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlvarezG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BernasconiDS00,
author = {Anna Bernasconi and
Carsten Damm and
Igor E. Shparlinski},
title = {The average sensitivity of square-freeness},
journal = {Comput. Complex.},
volume = {9},
number = {1},
pages = {39--51},
year = {2000},
url = {https://doi.org/10.1007/PL00001600},
doi = {10.1007/PL00001600},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BernasconiDS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Blaser00,
author = {Markus Bl{\"{a}}ser},
title = {Lower bounds for the bilinear complexity of associative algebras},
journal = {Comput. Complex.},
volume = {9},
number = {2},
pages = {73--112},
year = {2000},
url = {https://doi.org/10.1007/PL00001605},
doi = {10.1007/PL00001605},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Blaser00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Blume00,
author = {Frank Blume},
title = {On the relation between entropy and the average complexity of trajectories
in dynamical systems},
journal = {Comput. Complex.},
volume = {9},
number = {2},
pages = {146--155},
year = {2000},
url = {https://doi.org/10.1007/PL00001604},
doi = {10.1007/PL00001604},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Blume00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Green00,
author = {Frederic Green},
title = {A complex-number Fourier technique for lower bounds on the Mod-m degree},
journal = {Comput. Complex.},
volume = {9},
number = {1},
pages = {16--38},
year = {2000},
url = {https://doi.org/10.1007/PL00001599},
doi = {10.1007/PL00001599},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Green00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Greenhill00,
author = {Catherine S. Greenhill},
title = {The complexity of counting colourings and independent sets in sparse
graphs and hypergraphs},
journal = {Comput. Complex.},
volume = {9},
number = {1},
pages = {52--72},
year = {2000},
url = {https://doi.org/10.1007/PL00001601},
doi = {10.1007/PL00001601},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Greenhill00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HarshaS00,
author = {Prahladh Harsha and
Madhu Sudan},
title = {Small PCPs with low query complexity},
journal = {Comput. Complex.},
volume = {9},
number = {3-4},
pages = {157--201},
year = {2000},
url = {https://doi.org/10.1007/PL00001606},
doi = {10.1007/PL00001606},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HarshaS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KiwiLSRS00,
author = {Marcos A. Kiwi and
Carsten Lund and
Daniel A. Spielman and
Alexander Russell and
Ravi Sundaram},
title = {Alternation in interaction},
journal = {Comput. Complex.},
volume = {9},
number = {3-4},
pages = {202--246},
year = {2000},
url = {https://doi.org/10.1007/PL00001607},
doi = {10.1007/PL00001607},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KiwiLSRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PaturiSZ00,
author = {Ramamohan Paturi and
Michael E. Saks and
Francis Zane},
title = {Exponential lower bounds for depth three Boolean circuits},
journal = {Comput. Complex.},
volume = {9},
number = {1},
pages = {1--15},
year = {2000},
url = {https://doi.org/10.1007/PL00001598},
doi = {10.1007/PL00001598},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PaturiSZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Raz00,
author = {Ran Raz},
title = {The BNS-Chung criterion for multi-party communication complexity},
journal = {Comput. Complex.},
volume = {9},
number = {2},
pages = {113--122},
year = {2000},
url = {https://doi.org/10.1007/PL00001602},
doi = {10.1007/PL00001602},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Raz00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sieling00,
author = {Detlef Sieling},
title = {A separation of syntactic and nonsyntactic (1, +k)-branching programs},
journal = {Comput. Complex.},
volume = {9},
number = {3-4},
pages = {247--263},
year = {2000},
url = {https://doi.org/10.1007/PL00001608},
doi = {10.1007/PL00001608},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sieling00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderBO99,
author = {Eric Allender and
Robert Beals and
Mitsunori Ogihara},
title = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {99--126},
year = {1999},
url = {https://doi.org/10.1007/s000370050023},
doi = {10.1007/S000370050023},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AllenderBO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarringtonS99,
author = {David A. Mix Barrington and
Howard Straubing},
title = {Lower bounds for modular counting by circuits with modular gates},
journal = {Comput. Complex.},
volume = {8},
number = {3},
pages = {258--272},
year = {1999},
url = {https://doi.org/10.1007/s000370050030},
doi = {10.1007/S000370050030},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BarringtonS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BaurH99,
author = {Walter Baur and
Karin Halupczok},
title = {On lower bounds for the complexity of polynomials and their multiples},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {309--315},
year = {1999},
url = {https://doi.org/10.1007/s000370050001},
doi = {10.1007/S000370050001},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BaurH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BergU99,
author = {Christer Berg and
Staffan Ulfberg},
title = {Symmetric Approximation Arguments for Monotone Lower Bounds Without
Sunflowers},
journal = {Comput. Complex.},
volume = {8},
number = {1},
pages = {1--20},
year = {1999},
url = {https://doi.org/10.1007/s000370050017},
doi = {10.1007/S000370050017},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BergU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Blaser99,
author = {Markus Bl{\"{a}}ser},
title = {Lower bounds for the multiplicative complexity of matrix multiplication},
journal = {Comput. Complex.},
volume = {8},
number = {3},
pages = {203--226},
year = {1999},
url = {https://doi.org/10.1007/s000370050028},
doi = {10.1007/S000370050028},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Blaser99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlundoSPV99,
author = {Carlo Blundo and
Alfredo De Santis and
Giuseppe Persiano and
Ugo Vaccaro},
title = {Randomness Complexity of Private Computation},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {145--168},
year = {1999},
url = {https://doi.org/10.1007/s000370050025},
doi = {10.1007/S000370050025},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BlundoSPV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DietzfelbingerH99,
author = {Martin Dietzfelbinger and
Martin H{\"{u}}hne},
title = {Matching upper and lower bounds for simulations of several linear
tapes on one multidimensional tape},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {371--392},
year = {1999},
url = {https://doi.org/10.1007/s000370050006},
doi = {10.1007/S000370050006},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DietzfelbingerH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichP99,
author = {Oded Goldreich and
Erez Petrank},
title = {Quantifying Knowledge Complexity},
journal = {Comput. Complex.},
volume = {8},
number = {1},
pages = {50--98},
year = {1999},
url = {https://doi.org/10.1007/s000370050019},
doi = {10.1007/S000370050019},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grigoriev99,
author = {Dima Grigoriev},
title = {Complexity lower bounds for randomized computation trees over zero
characteristic fields},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {316--329},
year = {1999},
url = {https://doi.org/10.1007/s000370050002},
doi = {10.1007/S000370050002},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grigoriev99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HuangW99,
author = {Ming{-}Deh A. Huang and
Yiu{-}Chung Wong},
title = {Solvability of systems of polynomial congruences modulo a large prime},
journal = {Comput. Complex.},
volume = {8},
number = {3},
pages = {227--257},
year = {1999},
url = {https://doi.org/10.1007/s000370050029},
doi = {10.1007/S000370050029},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HuangW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ImpagliazzoPS99,
author = {Russell Impagliazzo and
Pavel Pudl{\'{a}}k and
Jir{\'{\i}} Sgall},
title = {Lower Bounds for the Polynomial Calculus and the Gr{\"{o}}bner
Basis Algorithm},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {127--144},
year = {1999},
url = {https://doi.org/10.1007/s000370050024},
doi = {10.1007/S000370050024},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ImpagliazzoPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ishihara99,
author = {Hajime Ishihara},
title = {Function algebraic characterizations of the polytime functions},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {346--356},
year = {1999},
url = {https://doi.org/10.1007/s000370050004},
doi = {10.1007/S000370050004},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ishihara99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IvanovR99,
author = {Sergei Ivanov and
Michel de Rougemont},
title = {Interactive protocols over the reals},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {330--345},
year = {1999},
url = {https://doi.org/10.1007/s000370050003},
doi = {10.1007/S000370050003},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/IvanovR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/JuknaRSW99,
author = {Stasys Jukna and
Alexander A. Razborov and
Petr Savick{\'{y}} and
Ingo Wegener},
title = {On {P} versus {NP} cap co-NP for decision trees and read-once branching
programs},
journal = {Comput. Complex.},
volume = {8},
number = {4},
pages = {357--370},
year = {1999},
url = {https://doi.org/10.1007/s000370050005},
doi = {10.1007/S000370050005},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/JuknaRSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Kapron99,
author = {Bruce M. Kapron},
title = {Feasibly Continuous Type-Two Functionals},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {188--201},
year = {1999},
url = {https://doi.org/10.1007/s000370050027},
doi = {10.1007/S000370050027},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Kapron99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KremerNR99,
author = {Ilan Kremer and
Noam Nisan and
Dana Ron},
title = {On Randomized One-Round Communication Complexity},
journal = {Comput. Complex.},
volume = {8},
number = {1},
pages = {21--49},
year = {1999},
url = {https://doi.org/10.1007/s000370050018},
doi = {10.1007/S000370050018},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KremerNR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LiskiewiczR99,
author = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {On small space complexity classes of stochastic Turing machines and
Arthur-Merlin-games},
journal = {Comput. Complex.},
volume = {8},
number = {3},
pages = {273--307},
year = {1999},
url = {https://doi.org/10.1007/s000370050031},
doi = {10.1007/S000370050031},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LiskiewiczR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/NaikS99,
author = {Ashish V. Naik and
Alan L. Selman},
title = {Adaptive Versus Nonadaptive Queries to {NP} and p-Selective Sets},
journal = {Comput. Complex.},
volume = {8},
number = {2},
pages = {169--187},
year = {1999},
url = {https://doi.org/10.1007/s000370050026},
doi = {10.1007/S000370050026},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/NaikS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AizensteinHHP98,
author = {Howard Aizenstein and
Tibor Heged{\"{u}}s and
Lisa Hellerstein and
Leonard Pitt},
title = {Complexity Theoretic Hardness Results for Query Learning},
journal = {Comput. Complex.},
volume = {7},
number = {1},
pages = {19--53},
year = {1998},
url = {https://doi.org/10.1007/PL00001593},
doi = {10.1007/PL00001593},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AizensteinHHP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeameIP98,
author = {Paul Beame and
Russell Impagliazzo and
Toniann Pitassi},
title = {Improved Depth Lower Bounds for Small Distance Connectivity},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {325--345},
year = {1998},
url = {https://doi.org/10.1007/s000370050014},
doi = {10.1007/S000370050014},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BeameIP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BookVW98,
author = {Ronald V. Book and
Heribert Vollmer and
Klaus W. Wagner},
title = {Probabilistic Type-2 Operators and "Almost"-Classes},
journal = {Comput. Complex.},
volume = {7},
number = {3},
pages = {265--289},
year = {1998},
url = {https://doi.org/10.1007/s000370050012},
doi = {10.1007/S000370050012},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BookVW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CrescenziS98,
author = {Pierluigi Crescenzi and
Riccardo Silvestri},
title = {Sperner's Lemma and Robust Machines},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {163--173},
year = {1998},
url = {https://doi.org/10.1007/s000370050008},
doi = {10.1007/S000370050008},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CrescenziS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DammJS98,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {109--127},
year = {1998},
url = {https://doi.org/10.1007/PL00001595},
doi = {10.1007/PL00001595},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DammJS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Egidi98,
author = {Lavinia Egidi},
title = {A quantifier elimination for the theory of \emph{p}-adic numbers},
journal = {Comput. Complex.},
volume = {7},
number = {3},
pages = {205--263},
year = {1998},
url = {https://doi.org/10.1007/s000370050011},
doi = {10.1007/S000370050011},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Egidi98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FeigenbaumFLN98,
author = {Joan Feigenbaum and
Lance Fortnow and
Sophie Laplante and
Ashish V. Naik},
title = {On Coherence, Random-Self-Reducibility, and Self-Correction},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {174--191},
year = {1998},
url = {https://doi.org/10.1007/s000370050009},
doi = {10.1007/S000370050009},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FeigenbaumFLN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GlaisterS98,
author = {Ian Glaister and
Jeffrey O. Shallit},
title = {Automaticity {III:} Polynomial Automaticity and Context-Free Languages},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {371--387},
year = {1998},
url = {https://doi.org/10.1007/s000370050016},
doi = {10.1007/S000370050016},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GlaisterS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrandjeanO98,
author = {Etienne Grandjean and
Fr{\'{e}}d{\'{e}}ric Olive},
title = {Monadic Logical Definability of Nondeterministic Linear Time},
journal = {Comput. Complex.},
volume = {7},
number = {1},
pages = {54--97},
year = {1998},
url = {https://doi.org/10.1007/PL00001594},
doi = {10.1007/PL00001594},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrandjeanO98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorievKY98,
author = {Dima Grigoriev and
Marek Karpinski and
Andrew Chi{-}Chih Yao},
title = {An exponential lower bound on the size of algebraic decision trees
for Max},
journal = {Comput. Complex.},
volume = {7},
number = {3},
pages = {193--203},
year = {1998},
url = {https://doi.org/10.1007/s000370050010},
doi = {10.1007/S000370050010},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigorievKY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grolmusz98,
author = {Vince Grolmusz},
title = {Circuits and Multi-Party Protocols},
journal = {Comput. Complex.},
volume = {7},
number = {1},
pages = {1--18},
year = {1998},
url = {https://doi.org/10.1007/PL00001592},
doi = {10.1007/PL00001592},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grolmusz98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KrauseP98,
author = {Matthias Krause and
Pavel Pudl{\'{a}}k},
title = {Computing Boolean Functions by Polynomials and Threshold Circuits},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {346--370},
year = {1998},
url = {https://doi.org/10.1007/s000370050015},
doi = {10.1007/S000370050015},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KrauseP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Razborov98,
author = {Alexander A. Razborov},
title = {Lower Bounds for the Polynomial Calculus},
journal = {Comput. Complex.},
volume = {7},
number = {4},
pages = {291--324},
year = {1998},
url = {https://doi.org/10.1007/s000370050013},
doi = {10.1007/S000370050013},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Razborov98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RussellS98,
author = {Alexander Russell and
Ravi Sundaram},
title = {Symmetric Alternation Captures {BPP}},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {152--162},
year = {1998},
url = {https://doi.org/10.1007/s000370050007},
doi = {10.1007/S000370050007},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/RussellS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SanthaT98,
author = {Miklos Santha and
Sovanna Tan},
title = {Verifying the Determinant in Parallel},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {128--151},
year = {1998},
url = {https://doi.org/10.1007/PL00001596},
doi = {10.1007/PL00001596},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/SanthaT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/TardosB98,
author = {G{\'{a}}bor Tardos and
David A. Mix Barrington},
title = {A Lower Bound on the Mod 6 Degree of the Or Function},
journal = {Comput. Complex.},
volume = {7},
number = {2},
pages = {99--108},
year = {1998},
url = {https://doi.org/10.1007/PL00001597},
doi = {10.1007/PL00001597},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/TardosB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarnesR97,
author = {Greg Barnes and
Walter L. Ruzzo},
title = {Undirected s-t Connectivity in Polynomial Time and Sublinear Space},
journal = {Comput. Complex.},
volume = {6},
number = {1},
pages = {1--28},
year = {1997},
url = {https://doi.org/10.1007/BF01202039},
doi = {10.1007/BF01202039},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BarnesR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelM97,
author = {Richard Beigel and
Alexis Maciel},
title = {Upper and Lower Bounds for Some Depth-3 Circuit Classes},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {235--255},
year = {1997},
url = {https://doi.org/10.1007/BF01294257},
doi = {10.1007/BF01294257},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeimelGP97,
author = {Amos Beimel and
Anna G{\'{a}}l and
Mike Paterson},
title = {Lower Bounds for Monotone Span Programs},
journal = {Comput. Complex.},
volume = {6},
number = {1},
pages = {29--45},
year = {1997},
url = {https://doi.org/10.1007/BF01202040},
doi = {10.1007/BF01202040},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeimelGP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Borodin97,
author = {Allan Borodin},
title = {Tribute to Roman Smolensky},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {195--198},
year = {1997},
url = {https://doi.org/10.1007/BF01294252},
doi = {10.1007/BF01294252},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Borodin97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Bruck97,
author = {Jehoshua Bruck},
title = {Reflections on "Representations of Sets of Boolean Functions by Commutative
Rings" by Roman Smolensky},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {209--212},
year = {1997},
url = {https://doi.org/10.1007/BF01294254},
doi = {10.1007/BF01294254},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Bruck97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Bshouty97,
author = {Nader H. Bshouty},
title = {Simple Learning Algorithms Using Divide and Conquer},
journal = {Comput. Complex.},
volume = {6},
number = {2},
pages = {174--194},
year = {1997},
url = {https://doi.org/10.1007/BF01262930},
doi = {10.1007/BF01262930},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Bshouty97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BussIPRS97,
author = {Samuel R. Buss and
Russell Impagliazzo and
Jan Kraj{\'{\i}}cek and
Pavel Pudl{\'{a}}k and
Alexander A. Razborov and
Jir{\'{\i}} Sgall},
title = {Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems
with Modular Counting},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {256--298},
year = {1997},
url = {https://doi.org/10.1007/BF01294258},
doi = {10.1007/BF01294258},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BussIPRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChandraRRST97,
author = {Ashok K. Chandra and
Prabhakar Raghavan and
Walter L. Ruzzo and
Roman Smolensky and
Prasoon Tiwari},
title = {The Electrical Resistance of a Graph Captures its Commute and Cover
Times},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {312--340},
year = {1997},
url = {https://doi.org/10.1007/BF01270385},
doi = {10.1007/BF01270385},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChandraRRST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Feige97,
author = {Uriel Feige},
title = {Collecting Coupons on Trees, and the Cover Time of Random Walks},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {341--356},
year = {1997},
url = {https://doi.org/10.1007/BF01270386},
doi = {10.1007/BF01270386},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Feige97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FeigeL97,
author = {Uriel Feige and
Carsten Lund},
title = {On the Hardness of Computing the Permanent of Random Matrices},
journal = {Comput. Complex.},
volume = {6},
number = {2},
pages = {101--132},
year = {1997},
url = {https://doi.org/10.1007/BF01262928},
doi = {10.1007/BF01262928},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FeigeL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GathenKS97,
author = {Joachim von zur Gathen and
Marek Karpinski and
Igor E. Shparlinski},
title = {Counting Curves and Their Projections},
journal = {Comput. Complex.},
volume = {6},
number = {1},
pages = {64--99},
year = {1997},
url = {https://doi.org/10.1007/BF01202042},
doi = {10.1007/BF01202042},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GathenKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorievKHS97,
author = {Dima Grigoriev and
Marek Karpinski and
Friedhelm Meyer auf der Heide and
Roman Smolensky},
title = {A Lower Bound for Randomized Algebraic Decision Trees},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {357--375},
year = {1997},
url = {https://doi.org/10.1007/BF01270387},
doi = {10.1007/BF01270387},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigorievKHS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigorievKS97,
author = {Dima Grigoriev and
Marek Karpinski and
Roman Smolensky},
title = {Randomization and the Computational Power of Analytic and Algebraic
Decision Trees},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {376--388},
year = {1997},
url = {https://doi.org/10.1007/BF01270388},
doi = {10.1007/BF01270388},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigorievKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuptaM97,
author = {Arvind Gupta and
Sanjeev Mahajan},
title = {Using Amplification to Compute Majority with Small Majority Gates},
journal = {Comput. Complex.},
volume = {6},
number = {1},
pages = {46--63},
year = {1997},
url = {https://doi.org/10.1007/BF01202041},
doi = {10.1007/BF01202041},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuptaM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/NisanW97,
author = {Noam Nisan and
Avi Wigderson},
title = {Lower Bounds on Arithmetic Circuits Via Partial Derivatives},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {217--234},
year = {1997},
url = {https://doi.org/10.1007/BF01294256},
doi = {10.1007/BF01294256},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/NisanW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ReischukS97,
author = {R{\"{u}}diger Reischuk and
Christian Schindelhauer},
title = {An Average Complexity Measure that Yields Tight Hierarchies},
journal = {Comput. Complex.},
volume = {6},
number = {2},
pages = {133--173},
year = {1997},
url = {https://doi.org/10.1007/BF01262929},
doi = {10.1007/BF01262929},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ReischukS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ShoupS97,
author = {Victor Shoup and
Roman Smolensky},
title = {Lower Bounds for Polynomial Evaluation and Interpolation Problems},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {301--311},
year = {1997},
url = {https://doi.org/10.1007/BF01270384},
doi = {10.1007/BF01270384},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ShoupS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Smolensky97,
author = {Roman Smolensky},
title = {Representations of Sets of Boolean Functions by Commutative Rings},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {199--208},
year = {1997},
url = {https://doi.org/10.1007/BF01294253},
doi = {10.1007/BF01294253},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Smolensky97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Smolensky97a,
author = {Roman Smolensky},
title = {Easy Lower Bound for a Strange Computational Model},
journal = {Comput. Complex.},
volume = {6},
number = {3},
pages = {213--216},
year = {1997},
url = {https://doi.org/10.1007/BF01294255},
doi = {10.1007/BF01294255},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Smolensky97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Smolensky97b,
author = {Roman Smolensky},
title = {Well-Known Bound for the VC-Dimension Made Easy},
journal = {Comput. Complex.},
volume = {6},
number = {4},
pages = {299--300},
year = {1997},
url = {https://doi.org/10.1007/BF01270383},
doi = {10.1007/BF01270383},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Smolensky97b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlonFWZ95,
author = {Noga Alon and
Uriel Feige and
Avi Wigderson and
David Zuckerman},
title = {Derandomized Graph Products},
journal = {Comput. Complex.},
volume = {5},
number = {1},
pages = {60--75},
year = {1995},
url = {https://doi.org/10.1007/BF01277956},
doi = {10.1007/BF01277956},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlonFWZ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AlvarezJ95,
author = {Carme {\`{A}}lvarez and
Birgit Jenner},
title = {A Note on Logspace Optimization},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {155--166},
year = {1995},
url = {https://doi.org/10.1007/BF01268143},
doi = {10.1007/BF01268143},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AlvarezJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChorS95,
author = {Benny Chor and
Netta Shani},
title = {The Privacy of Dense Symmetric Functions},
journal = {Comput. Complex.},
volume = {5},
number = {1},
pages = {43--59},
year = {1995},
url = {https://doi.org/10.1007/BF01277955},
doi = {10.1007/BF01277955},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ChorS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FichKKLR95,
author = {Faith E. Fich and
Miroslaw Kowaluk and
Miroslaw Kutylowski and
Krzysztof Lorys and
Prabhakar Ragde},
title = {Retrieval of Scattered Information by EREW, CREW, and {CRCW} PRAMs},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {113--131},
year = {1995},
url = {https://doi.org/10.1007/BF01268141},
doi = {10.1007/BF01268141},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FichKKLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HastadJP95,
author = {Johan H{\aa}stad and
Stasys Jukna and
Pavel Pudl{\'{a}}k},
title = {Top-Down Lower Bounds for Depth-Three Circuits},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {99--112},
year = {1995},
url = {https://doi.org/10.1007/BF01268140},
doi = {10.1007/BF01268140},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/HastadJP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HiltgenP95,
author = {Alain P. Hiltgen and
Mike Paterson},
title = {PI\({}_{\mbox{k}}\) Mass Production and an Optimal Circuit for the
Neciporuk Slice},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {132--154},
year = {1995},
url = {https://doi.org/10.1007/BF01268142},
doi = {10.1007/BF01268142},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HiltgenP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Juedes95,
author = {David W. Juedes},
title = {Weakly Complete Problems are not Rare},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {267--283},
year = {1995},
url = {https://doi.org/10.1007/BF01206322},
doi = {10.1007/BF01206322},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Juedes95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KarchmerRW95,
author = {Mauricio Karchmer and
Ran Raz and
Avi Wigderson},
title = {Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication
Complexity},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {191--204},
year = {1995},
url = {https://doi.org/10.1007/BF01206317},
doi = {10.1007/BF01206317},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/KarchmerRW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LickteigW95,
author = {Thomas Lickteig and
Kai Werther},
title = {How can a Complex Square Root be Computed in an Optimal Way},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {222--236},
year = {1995},
url = {https://doi.org/10.1007/BF01206319},
doi = {10.1007/BF01206319},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LickteigW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LittlestoneLW95,
author = {Nick Littlestone and
Philip M. Long and
Manfred K. Warmuth},
title = {On-line Learning of Linear Functions},
journal = {Comput. Complex.},
volume = {5},
number = {1},
pages = {1--23},
year = {1995},
url = {https://doi.org/10.1007/BF01277953},
doi = {10.1007/BF01277953},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LittlestoneLW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MaG95,
author = {Keju Ma and
Joachim von zur Gathen},
title = {The Computational Complexity of Recognizing Permutation Functions},
journal = {Comput. Complex.},
volume = {5},
number = {1},
pages = {76--97},
year = {1995},
url = {https://doi.org/10.1007/BF01277957},
doi = {10.1007/BF01277957},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Maurer95,
author = {Ueli M. Maurer},
title = {On the Oracle Complexity of Factoring Integers},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {237--247},
year = {1995},
url = {https://doi.org/10.1007/BF01206320},
doi = {10.1007/BF01206320},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Maurer95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Raz95,
author = {Ran Raz},
title = {Fourier Analysis for Probabilistic Communication Complexity},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {205--221},
year = {1995},
url = {https://doi.org/10.1007/BF01206318},
doi = {10.1007/BF01206318},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/Raz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sitharam95,
author = {Meera Sitharam},
title = {Evaluating Spectral Norms for Constant Depth Circuits with Symmetric
Gates},
journal = {Comput. Complex.},
volume = {5},
number = {2},
pages = {167--189},
year = {1995},
url = {https://doi.org/10.1007/BF01268144},
doi = {10.1007/BF01268144},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sitharam95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Sitharam95a,
author = {Meera Sitharam},
title = {Pseudorandom Generators and Learning Algorithms for {AC0}},
journal = {Comput. Complex.},
volume = {5},
number = {3/4},
pages = {248--266},
year = {1995},
url = {https://doi.org/10.1007/BF01206321},
doi = {10.1007/BF01206321},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Sitharam95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Turan95,
author = {Gy{\"{o}}rgy Tur{\'{a}}n},
title = {On the Complexity of Planar Boolean Circuits},
journal = {Comput. Complex.},
volume = {5},
number = {1},
pages = {24--42},
year = {1995},
url = {https://doi.org/10.1007/BF01277954},
doi = {10.1007/BF01277954},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Turan95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarringtonBR94,
author = {David A. Mix Barrington and
Richard Beigel and
Steven Rudich},
title = {Representing Boolean Functions as Polynomials Modulo Composite Numbers},
journal = {Comput. Complex.},
volume = {4},
pages = {367--382},
year = {1994},
url = {https://doi.org/10.1007/BF01263424},
doi = {10.1007/BF01263424},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BarringtonBR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BarringtonS94,
author = {David A. Mix Barrington and
Howard Straubing},
title = {Complex Polynomials and Circuit Lower Bounds for Modular Counting},
journal = {Comput. Complex.},
volume = {4},
pages = {325--338},
year = {1994},
url = {https://doi.org/10.1007/BF01263421},
doi = {10.1007/BF01263421},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BarringtonS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Beigel94,
author = {Richard Beigel},
title = {When do Extra Majority Gates Help? Polylog(\emph{N}) Majority Gates
Are Equivalent to One},
journal = {Comput. Complex.},
volume = {4},
pages = {314--324},
year = {1994},
url = {https://doi.org/10.1007/BF01263420},
doi = {10.1007/BF01263420},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Beigel94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Beigel94a,
author = {Richard Beigel},
title = {Perceptrons, PP, and the Polynomial Hierarchy},
journal = {Comput. Complex.},
volume = {4},
pages = {339--349},
year = {1994},
url = {https://doi.org/10.1007/BF01263422},
doi = {10.1007/BF01263422},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Beigel94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelT94,
author = {Richard Beigel and
Jun Tarui},
title = {On {ACC}},
journal = {Comput. Complex.},
volume = {4},
pages = {350--366},
year = {1994},
url = {https://doi.org/10.1007/BF01263423},
doi = {10.1007/BF01263423},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Bloch94,
author = {Stephen A. Bloch},
title = {Function-Algebraic Characterizations of Log and Polylog Parallel Time},
journal = {Comput. Complex.},
volume = {4},
pages = {175--205},
year = {1994},
url = {https://doi.org/10.1007/BF01202288},
doi = {10.1007/BF01202288},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Bloch94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyHHK94,
author = {Nader H. Bshouty and
Thomas R. Hancock and
Lisa Hellerstein and
Marek Karpinski},
title = {An Algorithm to Learn Read-Once Threshold Formulas, and Transformations
Between Learning Models},
journal = {Comput. Complex.},
volume = {4},
pages = {37--61},
year = {1994},
url = {https://doi.org/10.1007/BF01205054},
doi = {10.1007/BF01205054},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyHHK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Condon94,
author = {Anne Condon},
title = {A Theory of Strict P-Completeness},
journal = {Comput. Complex.},
volume = {4},
pages = {220--241},
year = {1994},
url = {https://doi.org/10.1007/BF01206637},
doi = {10.1007/BF01206637},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Condon94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FeigenbaumFLS94,
author = {Joan Feigenbaum and
Lance Fortnow and
Carsten Lund and
Daniel A. Spielman},
title = {The Power of Adaptiveness and Additional Queries in Random-Self-Reductions},
journal = {Comput. Complex.},
volume = {4},
pages = {158--174},
year = {1994},
url = {https://doi.org/10.1007/BF01202287},
doi = {10.1007/BF01202287},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FeigenbaumFLS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/FriezeT94,
author = {Alan M. Frieze and
Shang{-}Hua Teng},
title = {On the Complexity of Computing the Diameter of a Polytope},
journal = {Comput. Complex.},
volume = {4},
pages = {207--219},
year = {1994},
url = {https://doi.org/10.1007/BF01206636},
doi = {10.1007/BF01206636},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/FriezeT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Grandjean94,
author = {Etienne Grandjean},
title = {Invariance Properties of Rams and Linear Time},
journal = {Comput. Complex.},
volume = {4},
pages = {62--106},
year = {1994},
url = {https://doi.org/10.1007/BF01205055},
doi = {10.1007/BF01205055},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Grandjean94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HemaspaandraOT94,
author = {Lane A. Hemaspaandra and
Mitsunori Ogihara and
Seinosuke Toda},
title = {Space-Efficient Recognition of Sparse Self-Reducible Languages},
journal = {Comput. Complex.},
volume = {4},
pages = {262--296},
year = {1994},
url = {https://doi.org/10.1007/BF01206639},
doi = {10.1007/BF01206639},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HemaspaandraOT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/McKenzieT94,
author = {Pierre McKenzie and
Denis Th{\'{e}}rien},
title = {Special Issue on Circuit Complexity: Foreword},
journal = {Comput. Complex.},
volume = {4},
pages = {297--300},
year = {1994},
url = {https://doi.org/10.1007/BF01263418},
doi = {10.1007/BF01263418},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/McKenzieT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MontanaPR94,
author = {Jos{\'{e}} Luis Monta{\~{n}}a and
Luis Miguel Pardo and
Tom{\'{a}}s Recio},
title = {A Note on Rabin's Width of a Complete Proof},
journal = {Comput. Complex.},
volume = {4},
pages = {12--36},
year = {1994},
url = {https://doi.org/10.1007/BF01205053},
doi = {10.1007/BF01205053},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MontanaPR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Nisan94,
author = {Noam Nisan},
title = {{RL} {\textless}= {SC}},
journal = {Comput. Complex.},
volume = {4},
pages = {1--11},
year = {1994},
url = {https://doi.org/10.1007/BF01205052},
doi = {10.1007/BF01205052},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Nisan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/NisanS94,
author = {Noam Nisan and
Mario Szegedy},
title = {On the Degree of Boolean Functions as Real Polynomials},
journal = {Comput. Complex.},
volume = {4},
pages = {301--313},
year = {1994},
url = {https://doi.org/10.1007/BF01263419},
doi = {10.1007/BF01263419},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/NisanS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Patrank94,
author = {Erez Petrank},
title = {The Hardness of Approximation: Gap Location},
journal = {Comput. Complex.},
volume = {4},
pages = {133--157},
year = {1994},
url = {https://doi.org/10.1007/BF01202286},
doi = {10.1007/BF01202286},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Patrank94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RoyV94,
author = {Marie{-}Fran{\c{c}}oise Roy and
Nicolai N. Vorobjov Jr.},
title = {Finding Irreducible Components of Some Real Transcendental Varieties},
journal = {Comput. Complex.},
volume = {4},
pages = {107--132},
year = {1994},
url = {https://doi.org/10.1007/BF01202285},
doi = {10.1007/BF01202285},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/RoyV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Therien94,
author = {Denis Th{\'{e}}rien},
title = {Circuits Constructed with Mod{\_}q Gates Cannot Compute "And" in Sublinear
Size},
journal = {Comput. Complex.},
volume = {4},
pages = {383--388},
year = {1994},
url = {https://doi.org/10.1007/BF01263425},
doi = {10.1007/BF01263425},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Therien94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ThieraufTW94,
author = {Thomas Thierauf and
Seinosuke Toda and
Osamu Watanabe},
title = {On Closure Properties of GapP},
journal = {Comput. Complex.},
volume = {4},
pages = {242--261},
year = {1994},
url = {https://doi.org/10.1007/BF01206638},
doi = {10.1007/BF01206638},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ThieraufTW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderBP93,
author = {Eric Allender and
Danilo Bruschi and
Giovanni Pighizzini},
title = {The Complexity of Computing Maximal Word Functions},
journal = {Comput. Complex.},
volume = {3},
pages = {368--391},
year = {1993},
url = {https://doi.org/10.1007/BF01275489},
doi = {10.1007/BF01275489},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AllenderBP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BabaiFNW93,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow and
Noam Nisan and
Avi Wigderson},
title = {{BPP} Has Subexponential Time Simulations Unless {EXPTIME} has Publishable
Proofs},
journal = {Comput. Complex.},
volume = {3},
pages = {307--318},
year = {1993},
url = {https://doi.org/10.1007/BF01275486},
doi = {10.1007/BF01275486},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiFNW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BellareGG93,
author = {Mihir Bellare and
Oded Goldreich and
Shafi Goldwasser},
title = {Randomness in Interactive Proofs},
journal = {Comput. Complex.},
volume = {3},
pages = {319--354},
year = {1993},
url = {https://doi.org/10.1007/BF01275487},
doi = {10.1007/BF01275487},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BellareGG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BorodinRS93,
author = {Allan Borodin and
Alexander A. Razborov and
Roman Smolensky},
title = {On Lower Bounds for Read-K-Times Branching Programs},
journal = {Comput. Complex.},
volume = {3},
pages = {1--18},
year = {1993},
url = {https://doi.org/10.1007/BF01200404},
doi = {10.1007/BF01200404},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BorodinRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BraunmuhlGR93,
author = {Burchard von Braunm{\"{u}}hl and
Romain Gengler and
Robert Rettinger},
title = {The Alternation Hierarchy for Sublogarithmic Space is Infinite},
journal = {Comput. Complex.},
volume = {3},
pages = {207--230},
year = {1993},
url = {https://doi.org/10.1007/BF01271368},
doi = {10.1007/BF01271368},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BraunmuhlGR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BuhrmanST93,
author = {Harry Buhrman and
Edith Spaan and
Leen Torenvliet},
title = {The Relative Power of Logspace and Polynomial Time Reductions},
journal = {Comput. Complex.},
volume = {3},
pages = {231--244},
year = {1993},
url = {https://doi.org/10.1007/BF01271369},
doi = {10.1007/BF01271369},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BuhrmanST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CanettiG93,
author = {Ran Canetti and
Oded Goldreich},
title = {Bounds on Tradeoffs Between Randomness and Communication Complexity},
journal = {Comput. Complex.},
volume = {3},
pages = {141--167},
year = {1993},
url = {https://doi.org/10.1007/BF01200118},
doi = {10.1007/BF01200118},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CanettiG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CanigliaCDHKS93,
author = {Leandro Caniglia and
Guillermo Corti{\~{n}}as and
Silvia Dan{\'{o}}n and
Joos Heintz and
Teresa Krick and
Pablo Solern{\'{o}}},
title = {(Working Group Noa{\"{\i}} Fitchas) Algorithmic Aspects of Suslin's
Proof of Serre's Conjecture},
journal = {Comput. Complex.},
volume = {3},
pages = {31--55},
year = {1993},
url = {https://doi.org/10.1007/BF01200406},
doi = {10.1007/BF01200406},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CanigliaCDHKS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Condon93,
author = {Anne Condon},
title = {The Complexity of the Max Word Problem and the Power of One-Way Interactive
Proof Systems},
journal = {Comput. Complex.},
volume = {3},
pages = {292--305},
year = {1993},
url = {https://doi.org/10.1007/BF01271372},
doi = {10.1007/BF01271372},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Condon93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CookD93,
author = {Stephen A. Cook and
Patrick W. Dymond},
title = {Parallel Pointer Machines},
journal = {Comput. Complex.},
volume = {3},
pages = {19--30},
year = {1993},
url = {https://doi.org/10.1007/BF01200405},
doi = {10.1007/BF01200405},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CookD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GiustiHS93,
author = {Marc Giusti and
Joos Heintz and
Juan Sabia},
title = {On the Efficiency of Effective Nullstellens{\"{a}}tze},
journal = {Comput. Complex.},
volume = {3},
pages = {56--95},
year = {1993},
url = {https://doi.org/10.1007/BF01200407},
doi = {10.1007/BF01200407},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GiustiHS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldsmithJ93,
author = {Judy Goldsmith and
Deborah Joseph},
title = {Relativized Isomorphisms of NP-Complete Sets},
journal = {Comput. Complex.},
volume = {3},
pages = {186--205},
year = {1993},
url = {https://doi.org/10.1007/BF01200120},
doi = {10.1007/BF01200120},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldsmithJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/IvanyosR93,
author = {G{\'{a}}bor Ivanyos and
Lajos R{\'{o}}nyai},
title = {Finding Maximal Orders in Semisimple Algebras Over {Q}},
journal = {Comput. Complex.},
volume = {3},
pages = {245--261},
year = {1993},
url = {https://doi.org/10.1007/BF01271370},
doi = {10.1007/BF01271370},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/IvanyosR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MaassSST93,
author = {Wolfgang Maass and
Georg Schnitger and
Endre Szemer{\'{e}}di and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Two Tapes Versus One for Off-Line Turing Machines},
journal = {Comput. Complex.},
volume = {3},
pages = {392--401},
year = {1993},
url = {https://doi.org/10.1007/BF01275490},
doi = {10.1007/BF01275490},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MaassSST93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PatersonZ93,
author = {Mike Paterson and
Uri Zwick},
title = {Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication},
journal = {Comput. Complex.},
volume = {3},
pages = {262--291},
year = {1993},
url = {https://doi.org/10.1007/BF01271371},
doi = {10.1007/BF01271371},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PatersonZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PeraltaS93,
author = {Ren{\'{e}} Peralta and
Victor Shoup},
title = {Primality Testing with Fewer Random Bits},
journal = {Comput. Complex.},
volume = {3},
pages = {355--367},
year = {1993},
url = {https://doi.org/10.1007/BF01275488},
doi = {10.1007/BF01275488},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PeraltaS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PitassiBI93,
author = {Toniann Pitassi and
Paul Beame and
Russell Impagliazzo},
title = {Exponential Lower Bounds for the Pigeonhole Principle},
journal = {Comput. Complex.},
volume = {3},
pages = {97--140},
year = {1993},
url = {https://doi.org/10.1007/BF01200117},
doi = {10.1007/BF01200117},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/PitassiBI93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RanjanCR93,
author = {Desh Ranjan and
Suresh Chari and
Pankaj Rohatgi},
title = {Improving Known Solutions is Hard},
journal = {Comput. Complex.},
volume = {3},
pages = {168--185},
year = {1993},
url = {https://doi.org/10.1007/BF01200119},
doi = {10.1007/BF01200119},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/RanjanCR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AurenhammerHI92,
author = {Franz Aurenhammer and
Johann Hagauer and
Wilfried Imrich},
title = {Cartesian Graph Factorization at Logarithmic Cost per Edge},
journal = {Comput. Complex.},
volume = {2},
pages = {331--349},
year = {1992},
url = {https://doi.org/10.1007/BF01200428},
doi = {10.1007/BF01200428},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AurenhammerHI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BabaiFL92,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow and
Carsten Lund},
title = {Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive
Protocols},
journal = {Comput. Complex.},
volume = {2},
pages = {374},
year = {1992},
url = {https://doi.org/10.1007/BF01200430},
doi = {10.1007/BF01200430},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiFL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BeigelF92,
author = {Richard Beigel and
Joan Feigenbaum},
title = {On Being Incoherent Without Being Very Hard},
journal = {Comput. Complex.},
volume = {2},
pages = {1--17},
year = {1992},
url = {https://doi.org/10.1007/BF01276436},
doi = {10.1007/BF01276436},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BeigelF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BellantoniC92,
author = {Stephen J. Bellantoni and
Stephen A. Cook},
title = {A New Recursion-Theoretic Characterization of the Polytime Functions},
journal = {Comput. Complex.},
volume = {2},
pages = {97--110},
year = {1992},
url = {https://doi.org/10.1007/BF01201998},
doi = {10.1007/BF01201998},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BellantoniC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BerkmanMV92,
author = {Omer Berkman and
Yossi Matias and
Uzi Vishkin},
title = {Randomized Range-Maxima in Nearly-Constant Parallel Time},
journal = {Comput. Complex.},
volume = {2},
pages = {350--373},
year = {1992},
url = {https://doi.org/10.1007/BF01200429},
doi = {10.1007/BF01200429},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BerkmanMV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BshoutyMST92,
author = {Nader H. Bshouty and
Yishay Mansour and
Baruch Schieber and
Prasoon Tiwari},
title = {Fast Exponentiation Using the Truncation Operation},
journal = {Comput. Complex.},
volume = {2},
pages = {244--255},
year = {1992},
url = {https://doi.org/10.1007/BF01272076},
doi = {10.1007/BF01272076},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BshoutyMST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/CosterJLOSS92,
author = {Matthijs J. Coster and
Antoine Joux and
Brian A. LaMacchia and
Andrew M. Odlyzko and
Claus{-}Peter Schnorr and
Jacques Stern},
title = {Improved Low-Density Subset Sum Algorithms},
journal = {Comput. Complex.},
volume = {2},
pages = {111--128},
year = {1992},
url = {https://doi.org/10.1007/BF01201999},
doi = {10.1007/BF01201999},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/CosterJLOSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GathenS92,
author = {Joachim von zur Gathen and
Victor Shoup},
title = {Computing Frobenius Maps and Factoring Polynomials},
journal = {Comput. Complex.},
volume = {2},
pages = {187--224},
year = {1992},
url = {https://doi.org/10.1007/BF01272074},
doi = {10.1007/BF01272074},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GathenS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldmannHR92,
author = {Mikael Goldmann and
Johan H{\aa}stad and
Alexander A. Razborov},
title = {Majority Gates {VS.} General Weighted Threshold Gates},
journal = {Comput. Complex.},
volume = {2},
pages = {277--300},
year = {1992},
url = {https://doi.org/10.1007/BF01200426},
doi = {10.1007/BF01200426},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldmannHR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldsmithHK92,
author = {Judy Goldsmith and
Lane A. Hemachandra and
Kenneth Kunen},
title = {Polynomial-Time Compression},
journal = {Comput. Complex.},
volume = {2},
pages = {18--39},
year = {1992},
url = {https://doi.org/10.1007/BF01276437},
doi = {10.1007/BF01276437},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldsmithHK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GrigoryevV92,
author = {D. Yu. Grigoryev and
Nicolai N. Vorobjov Jr.},
title = {Counting Connected Components of a Semialgebraic Set in Subexponential
Time},
journal = {Comput. Complex.},
volume = {2},
pages = {133--186},
year = {1992},
url = {https://doi.org/10.1007/BF01202001},
doi = {10.1007/BF01202001},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GrigoryevV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GuimaraesGP92,
author = {Katia S. Guimar{\~{a}}es and
William I. Gasarch and
James M. Purtilo},
title = {Selection Problems via M-Ary Queries},
journal = {Comput. Complex.},
volume = {2},
pages = {256--276},
year = {1992},
url = {https://doi.org/10.1007/BF01272077},
doi = {10.1007/BF01272077},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GuimaraesGP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoblerST92,
author = {Johannes K{\"{o}}bler and
Uwe Sch{\"{o}}ning and
Jacobo Tor{\'{a}}n},
title = {Graph Isomorphism is Low for {PP}},
journal = {Comput. Complex.},
volume = {2},
pages = {301--330},
year = {1992},
url = {https://doi.org/10.1007/BF01200427},
doi = {10.1007/BF01200427},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KoblerST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Lynch92,
author = {James F. Lynch},
title = {The Quantifier Structure of Sentences That Characterize Nondeterministic
Time Complexity},
journal = {Comput. Complex.},
volume = {2},
pages = {40--66},
year = {1992},
url = {https://doi.org/10.1007/BF01276438},
doi = {10.1007/BF01276438},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Lynch92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Ronyai92,
author = {Lajos R{\'{o}}nyai},
title = {Algorithmic Properties of Maximal Orders in Simple Algebras over {Q}},
journal = {Comput. Complex.},
volume = {2},
pages = {225--243},
year = {1992},
url = {https://doi.org/10.1007/BF01272075},
doi = {10.1007/BF01272075},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Ronyai92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shokrollahi92,
author = {Mohammad Amin Shokrollahi},
title = {Efficient Randomized Generation of Optimal Algorithms for Multiplication
in Certain Finite Fields},
journal = {Comput. Complex.},
volume = {2},
pages = {67--96},
year = {1992},
url = {https://doi.org/10.1007/BF01276439},
doi = {10.1007/BF01276439},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shokrollahi92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shparlinski92,
author = {Igor E. Shparlinski},
title = {A Deterministic Test for Permutation Polynomials},
journal = {Comput. Complex.},
volume = {2},
pages = {129--132},
year = {1992},
url = {https://doi.org/10.1007/BF01202000},
doi = {10.1007/BF01202000},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shparlinski92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BabaiF91,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow},
title = {Arithmetization: {A} New Method in Structural Complexity Theory},
journal = {Comput. Complex.},
volume = {1},
pages = {41--66},
year = {1991},
url = {https://doi.org/10.1007/BF01200057},
doi = {10.1007/BF01200057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BabaiFL91,
author = {L{\'{a}}szl{\'{o}} Babai and
Lance Fortnow and
Carsten Lund},
title = {Non-Deterministic Exponential Time has Two-Prover Interactive Protocols},
journal = {Comput. Complex.},
volume = {1},
pages = {3--40},
year = {1991},
url = {https://doi.org/10.1007/BF01200056},
doi = {10.1007/BF01200056},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BabaiFL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Baum91,
author = {Ulrich Baum},
title = {Existence and Efficient Construction of Fast Fourier Transforms on
Supersolvable Groups},
journal = {Comput. Complex.},
volume = {1},
pages = {235--256},
year = {1991},
url = {https://doi.org/10.1007/BF01200062},
doi = {10.1007/BF01200062},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Baum91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BorodinT91,
author = {Allan Borodin and
Prasoon Tiwari},
title = {On the Decidability of Sparse Univariate Polynomial Interpolation},
journal = {Comput. Complex.},
volume = {1},
pages = {67--90},
year = {1991},
url = {https://doi.org/10.1007/BF01200058},
doi = {10.1007/BF01200058},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BorodinT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BurgisserKL91,
author = {Peter B{\"{u}}rgisser and
Marek Karpinski and
Thomas Lickteig},
title = {Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication},
journal = {Comput. Complex.},
volume = {1},
pages = {131--155},
year = {1991},
url = {https://doi.org/10.1007/BF01272518},
doi = {10.1007/BF01272518},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BurgisserKL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Cleve91,
author = {Richard Cleve},
title = {Towards Optimal Simulations of Formulas by Bounded-Width Programs},
journal = {Comput. Complex.},
volume = {1},
pages = {91--105},
year = {1991},
url = {https://doi.org/10.1007/BF01200059},
doi = {10.1007/BF01200059},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Cleve91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Eberly91,
author = {Wayne Eberly},
title = {Decomposition of Algebras Over Finite Fields and Number Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {183--210},
year = {1991},
url = {https://doi.org/10.1007/BF01272520},
doi = {10.1007/BF01272520},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Eberly91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Eberly91a,
author = {Wayne Eberly},
title = {Decompositions of Algebras Over {R} and {C}},
journal = {Comput. Complex.},
volume = {1},
pages = {211--234},
year = {1991},
url = {https://doi.org/10.1007/BF01200061},
doi = {10.1007/BF01200061},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Eberly91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Gathen91,
author = {Joachim von zur Gathen},
title = {Efficient and Optimal Exponentiation in Finite Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {360--394},
year = {1991},
url = {https://doi.org/10.1007/BF01212964},
doi = {10.1007/BF01212964},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Gathen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HastadG91,
author = {Johan H{\aa}stad and
Mikael Goldmann},
title = {On the Power of Small-Depth Threshold Circuits},
journal = {Comput. Complex.},
volume = {1},
pages = {113--129},
year = {1991},
url = {https://doi.org/10.1007/BF01272517},
doi = {10.1007/BF01272517},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HastadG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HeimanW91,
author = {Rafi Heiman and
Avi Wigderson},
title = {Randomized {VS.} Deterministic Decision Tree Complexity for Read-Once
Boolean Functions},
journal = {Comput. Complex.},
volume = {1},
pages = {311--329},
year = {1991},
url = {https://doi.org/10.1007/BF01212962},
doi = {10.1007/BF01212962},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HeimanW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Hirsch91,
author = {Michael D. Hirsch},
title = {Lower Bounds for the Non-Linear Complexity of Algebraic Computation
Trees with Integer Inputs},
journal = {Comput. Complex.},
volume = {1},
pages = {257--268},
year = {1991},
url = {https://doi.org/10.1007/BF01200063},
doi = {10.1007/BF01200063},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Hirsch91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KoT91,
author = {Ker{-}I Ko and
Wen{-}Guey Tzeng},
title = {Three Sigmap{\_}2-Complete Problems in Computational Learning Theory},
journal = {Comput. Complex.},
volume = {1},
pages = {269--310},
year = {1991},
url = {https://doi.org/10.1007/BF01200064},
doi = {10.1007/BF01200064},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KoT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/McKenziePT91,
author = {Pierre McKenzie and
Pierre P{\'{e}}ladeau and
Denis Th{\'{e}}rien},
title = {NC{\({^1}\)}: The Automata-Theoretic Viewpoint},
journal = {Comput. Complex.},
volume = {1},
pages = {330--359},
year = {1991},
url = {https://doi.org/10.1007/BF01212963},
doi = {10.1007/BF01212963},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/McKenziePT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/Shokrollahi91,
author = {Mohammad Amin Shokrollahi},
title = {On the Rank of Certain Finite Fields},
journal = {Comput. Complex.},
volume = {1},
pages = {157--181},
year = {1991},
url = {https://doi.org/10.1007/BF01272519},
doi = {10.1007/BF01272519},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Shokrollahi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2025-01-13 09:47 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
