Search dblp for Publications

export results for "toc:db/journals/cc/cc32.bht:"

 download as .bib file

@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    = {Sun, 10 Dec 2023 00:00:00 +0100},
  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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics