Search dblp for Publications

export results for "toc:db/journals/toct/toct16.bht:"

 download as .bib file

@article{DBLP:journals/toct/GrochowQ24,
  author       = {Joshua A. Grochow and
                  Youming Qiao},
  title        = {On \emph{p}-Group Isomorphism: Search-to-Decision, Counting-to-Decision,
                  and Nilpotency Class Reductions via Tensors},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {16},
  number       = {1},
  pages        = {2:1--2:39},
  year         = {2024},
  url          = {https://doi.org/10.1145/3625308},
  doi          = {10.1145/3625308},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/GrochowQ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/JansenW24,
  author       = {Bart M. P. Jansen and
                  Michal Wlodarczyk},
  title        = {Optimal Polynomial-Time Compression for Boolean Max {CSP}},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {16},
  number       = {1},
  pages        = {4:1--4:20},
  year         = {2024},
  url          = {https://doi.org/10.1145/3624704},
  doi          = {10.1145/3624704},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/JansenW24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KurpiszLM24,
  author       = {Adam Kurpisz and
                  Samuli Lepp{\"{a}}nen and
                  Monaldo Mastrolilli},
  title        = {Tight Sum-of-squares Lower Bounds for Binary Polynomial2 Optimization
                  Problems},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {16},
  number       = {1},
  pages        = {3:1--3:16},
  year         = {2024},
  url          = {https://doi.org/10.1145/3626106},
  doi          = {10.1145/3626106},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/KurpiszLM24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/MontanaroS24,
  author       = {Ashley Montanaro and
                  Changpeng Shao},
  title        = {Quantum Communication Complexity of Linear Regression},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {16},
  number       = {1},
  pages        = {1:1--1:30},
  year         = {2024},
  url          = {https://doi.org/10.1145/3625225},
  doi          = {10.1145/3625225},
  timestamp    = {Mon, 01 Apr 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/MontanaroS24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics