Landsberg, J. M. Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science. (English) Zbl 07538403 Differ. Geom. Appl. 82, Article ID 101888, 23 p. (2022). MSC: 14L30 68Q15 68Q17 15A69 14L35 13F20 PDF BibTeX XML Cite \textit{J. M. Landsberg}, Differ. Geom. Appl. 82, Article ID 101888, 23 p. (2022; Zbl 07538403) Full Text: DOI OpenURL
Kaiser, Marcus Computation of dynamic equilibria in series-parallel networks. (English) Zbl 07527980 Math. Oper. Res. 47, No. 1, 50-71 (2022). MSC: 90B10 90B15 90B22 68Q15 05C21 PDF BibTeX XML Cite \textit{M. Kaiser}, Math. Oper. Res. 47, No. 1, 50--71 (2022; Zbl 07527980) Full Text: DOI OpenURL
Byszewski, Jakub; Cornelissen, Gunther; Tijsma, Djurre Automata and finite order elements in the Nottingham group. (English) Zbl 07515344 J. Algebra 602, 484-554 (2022). MSC: 11B85 11-04 11G20 11S31 11Y16 20E18 20E45 68Q70 PDF BibTeX XML Cite \textit{J. Byszewski} et al., J. Algebra 602, 484--554 (2022; Zbl 07515344) Full Text: DOI OpenURL
Ikenmeyer, Christian; Sanyal, Abhiroop A note on VNP-completeness and border complexity. (English) Zbl 07504765 Inf. Process. Lett. 176, Article ID 106243, 8 p. (2022). MSC: 68Q15 PDF BibTeX XML Cite \textit{C. Ikenmeyer} and \textit{A. Sanyal}, Inf. Process. Lett. 176, Article ID 106243, 8 p. (2022; Zbl 07504765) Full Text: DOI OpenURL
Gillibert, Pierre; Jonušas, Julius; Kompatscher, Michael; Mottet, Antoine; Pinsker, Michael When symmetries are not enough: a hierarchy of hard constraint satisfaction problems. (English) Zbl 1483.68141 SIAM J. Comput. 51, No. 2, 175-213 (2022). MSC: 68Q15 03C05 03C35 08A40 08A70 68R07 PDF BibTeX XML Cite \textit{P. Gillibert} et al., SIAM J. Comput. 51, No. 2, 175--213 (2022; Zbl 1483.68141) Full Text: DOI OpenURL
Wu, Huishan The computational complexity of module socles. (English) Zbl 07501983 Ann. Pure Appl. Logic 173, No. 5, Article ID 103089, 11 p. (2022). MSC: 03D15 03D80 68Q15 68Q17 PDF BibTeX XML Cite \textit{H. Wu}, Ann. Pure Appl. Logic 173, No. 5, Article ID 103089, 11 p. (2022; Zbl 07501983) Full Text: DOI OpenURL
Prochno, Joscha; Strzelecki, Michał Approximation, Gelfand, and Kolmogorov numbers of Schatten class embeddings. (English) Zbl 07501643 J. Approx. Theory 277, Article ID 105736, 33 p. (2022). MSC: 47B10 47B06 46B20 46B06 46B07 46B28 68Q25 PDF BibTeX XML Cite \textit{J. Prochno} and \textit{M. Strzelecki}, J. Approx. Theory 277, Article ID 105736, 33 p. (2022; Zbl 07501643) Full Text: DOI OpenURL
Mescoff, Guillaume; Paul, Christophe; Thilikos, Dimitrios M. A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. (English) Zbl 07497778 Discrete Appl. Math. 312, 72-85 (2022). MSC: 68R10 68Q25 05C85 91A43 05C05 PDF BibTeX XML Cite \textit{G. Mescoff} et al., Discrete Appl. Math. 312, 72--85 (2022; Zbl 07497778) Full Text: DOI OpenURL
Carvalho, Catarina; Martin, Barnaby The lattice and semigroup structure of multipermutations. (English) Zbl 07492582 Int. J. Algebra Comput. 32, No. 2, 211-235 (2022). MSC: 06B05 68Q15 20M10 03C05 PDF BibTeX XML Cite \textit{C. Carvalho} and \textit{B. Martin}, Int. J. Algebra Comput. 32, No. 2, 211--235 (2022; Zbl 07492582) Full Text: DOI arXiv OpenURL
Filos-Ratsikas, Aris; Goldberg, Paul W. The complexity of necklace splitting, consensus-halving, and discrete ham sandwich. (English) Zbl 07488094 SIAM J. Comput. 51, No. 1, STOC19-200-STOC19-268 (2022). MSC: 68Q15 68Q17 68R05 PDF BibTeX XML Cite \textit{A. Filos-Ratsikas} and \textit{P. W. Goldberg}, SIAM J. Comput. 51, No. 1, STOC19--200-STOC19--268 (2022; Zbl 07488094) Full Text: DOI OpenURL
Di Stefano, Gabriele Mutual visibility in graphs. (English) Zbl 07483683 Appl. Math. Comput. 419, Article ID 126850, 13 p. (2022). MSC: 05Cxx 68Rxx 68Qxx PDF BibTeX XML Cite \textit{G. Di Stefano}, Appl. Math. Comput. 419, Article ID 126850, 13 p. (2022; Zbl 07483683) Full Text: DOI arXiv OpenURL
Amigó, José M.; Dale, Roberto; Tempesta, Piergiulio Complexity-based permutation entropies: from deterministic time series to white noise. (English) Zbl 1479.94085 Commun. Nonlinear Sci. Numer. Simul. 105, Article ID 106077, 19 p. (2022). MSC: 94A17 62M10 PDF BibTeX XML Cite \textit{J. M. Amigó} et al., Commun. Nonlinear Sci. Numer. Simul. 105, Article ID 106077, 19 p. (2022; Zbl 1479.94085) Full Text: DOI arXiv OpenURL
Choudhuri, Arka Rai; Jain, Abhishek; Jin, Zhengzhong Non-interactive batch arguments for NP from standard assumptions. (English) Zbl 07529206 Malkin, Tal (ed.) et al., Advances in cryptology – CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16–20, 2021. Proceedings. Part IV. Cham: Springer. Lect. Notes Comput. Sci. 12828, 394-423 (2021). MSC: 68Q15 68Q10 94A60 PDF BibTeX XML Cite \textit{A. R. Choudhuri} et al., Lect. Notes Comput. Sci. 12828, 394--423 (2021; Zbl 07529206) Full Text: DOI OpenURL
Fogarasi, Kinga; Nagy, Benedek Notes of the NP-completeness of the membership problem of ET0L languages. (English) Zbl 07503608 C. R. Acad. Bulg. Sci. 74, No. 7, 964-971 (2021). Reviewer: Angela Slavova (Sofia) MSC: 68Q42 68Q10 68Q15 PDF BibTeX XML Cite \textit{K. Fogarasi} and \textit{B. Nagy}, C. R. Acad. Bulg. Sci. 74, No. 7, 964--971 (2021; Zbl 07503608) Full Text: DOI OpenURL
Bünz, Benedikt; Chiesa, Alessandro; Lin, William; Mishra, Pratyush; Spooner, Nicholas Proof-carrying data without succinct arguments. (English) Zbl 1485.94066 Malkin, Tal (ed.) et al., Advances in cryptology – CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16–20, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12825, 681-710 (2021). MSC: 94A60 68Q15 PDF BibTeX XML Cite \textit{B. Bünz} et al., Lect. Notes Comput. Sci. 12825, 681--710 (2021; Zbl 1485.94066) Full Text: DOI OpenURL
Kublenz, Simeon; Siebertz, Sebastian; Vigny, Alexandre Constant round distributed domination on graph classes with bounded expansion. (English) Zbl 07495148 Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 334-351 (2021). MSC: 68Mxx 68Q11 68R10 PDF BibTeX XML Cite \textit{S. Kublenz} et al., Lect. Notes Comput. Sci. 12810, 334--351 (2021; Zbl 07495148) Full Text: DOI arXiv OpenURL
Krylatov, Alexander Equilibrium traffic flow assignment in a multi-subnet urban road network. (English) Zbl 1485.90020 Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 3-16 (2021). MSC: 90B20 90B10 68Q15 90C30 90C35 PDF BibTeX XML Cite \textit{A. Krylatov}, Lect. Notes Comput. Sci. 12755, 3--16 (2021; Zbl 1485.90020) Full Text: DOI OpenURL
Babai, László; Hansen, Kristoffer A.; Podolskii, Vladimir V.; Sun, Xiaoming Weights of exact threshold functions. (English. Russian original) Zbl 07480686 Izv. Math. 85, No. 6, 1039-1059 (2021); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 5-26 (2021). MSC: 94C11 94D10 68Q15 PDF BibTeX XML Cite \textit{L. Babai} et al., Izv. Math. 85, No. 6, 1039--1059 (2021; Zbl 07480686); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 5--26 (2021) Full Text: DOI MNR OpenURL
Forbes, Michael A.; Shpilka, Amir; Tzameret, Iddo; Wigderson, Avi Proof complexity lower bounds from algebraic circuit complexity. (English) Zbl 07471587 Theory Comput. 17, Paper No. 10, 88 p. (2021). MSC: 68Q17 68Q15 03F20 PDF BibTeX XML Cite \textit{M. A. Forbes} et al., Theory Comput. 17, Paper No. 10, 88 p. (2021; Zbl 07471587) Full Text: DOI OpenURL
Don, Arjuna P. H.; Peters, James F.; Ramanna, Sheela Persistence barcoded vehicular traffic videos in a topology of data approach to shape tracking. (English) Zbl 07469650 Paikray, Susanta Kumar (ed.) et al., New trends in applied analysis and computational mathematics. Proceedings of the international conference on advances in mathematics and computing, ICAMC 2020, Odisha, India, February 7–8, 2020. Singapore: Springer. Adv. Intell. Syst. Comput. 1356, 33-43 (2021). MSC: 68U10 54H30 54C56 55R40 55U10 55N31 55M30 PDF BibTeX XML Cite \textit{A. P. H. Don} et al., Adv. Intell. Syst. Comput. 1356, 33--43 (2021; Zbl 07469650) Full Text: DOI OpenURL
Kupriyanov, B. V.; Lazarev, A. A. Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. (English. Russian original) Zbl 1481.90173 Autom. Remote Control 82, No. 11, 1892-1906 (2021); translation from Avtom. Telemekh. 2021, No. 11, 75-93 (2021). MSC: 90B35 68T20 91B32 68Q15 PDF BibTeX XML Cite \textit{B. V. Kupriyanov} and \textit{A. A. Lazarev}, Autom. Remote Control 82, No. 11, 1892--1906 (2021; Zbl 1481.90173); translation from Avtom. Telemekh. 2021, No. 11, 75--93 (2021) Full Text: DOI OpenURL
Kutrib, Martin; Malcher, Andreas Digging input-driven pushdown automata. (English) Zbl 07455934 RAIRO, Theor. Inform. Appl. 55, Paper No. 6, 19 p. (2021). MSC: 68Q45 68Q15 PDF BibTeX XML Cite \textit{M. Kutrib} and \textit{A. Malcher}, RAIRO, Theor. Inform. Appl. 55, Paper No. 6, 19 p. (2021; Zbl 07455934) Full Text: DOI OpenURL
Àlvarez, Carme; Duch, Amalia Some results of Maria Serna on strategic games: complexity of equilibria and models. (English) Zbl 07449917 Comput. Sci. Rev. 39, Article ID 100346, 10 p. (2021). MSC: 91A40 91A43 91A68 PDF BibTeX XML Cite \textit{C. Àlvarez} and \textit{A. Duch}, Comput. Sci. Rev. 39, Article ID 100346, 10 p. (2021; Zbl 07449917) Full Text: DOI OpenURL
Pavešić, Petar Topological complexity of real Grassmannians. (English) Zbl 07446640 Proc. R. Soc. Edinb., Sect. A, Math. 151, No. 6, 2013-2029 (2021). MSC: 55M30 55S40 PDF BibTeX XML Cite \textit{P. Pavešić}, Proc. R. Soc. Edinb., Sect. A, Math. 151, No. 6, 2013--2029 (2021; Zbl 07446640) Full Text: DOI arXiv OpenURL
Bull, Jonathan; Engblom, Stefan Distributed and adaptive fast multipole method in three dimensions. (English) Zbl 1473.65004 Commun. Comput. Phys. 30, No. 4, 959-984 (2021). MSC: 65B10 65Y05 65Y10 65Y20 68W15 PDF BibTeX XML Cite \textit{J. Bull} and \textit{S. Engblom}, Commun. Comput. Phys. 30, No. 4, 959--984 (2021; Zbl 1473.65004) Full Text: DOI arXiv OpenURL
Gavinsky, Dmitry The layer complexity of Arthur-Merlin-like communication. (English) Zbl 07413503 Theory Comput. 17, Paper No. 8, 28 p. (2021). MSC: 68Q15 68Qxx PDF BibTeX XML Cite \textit{D. Gavinsky}, Theory Comput. 17, Paper No. 8, 28 p. (2021; Zbl 07413503) Full Text: DOI arXiv OpenURL
Bun, Mark; Thaler, Justin The large-error approximate degree of \(\mathrm{AC}^0\). (English) Zbl 07413502 Theory Comput. 17, Paper No. 7, 46 p. (2021). MSC: 68Q15 68Q17 68Q32 68Qxx PDF BibTeX XML Cite \textit{M. Bun} and \textit{J. Thaler}, Theory Comput. 17, Paper No. 7, 46 p. (2021; Zbl 07413502) Full Text: DOI OpenURL
Hatano, Naoya; Ikeda, Masahiro; Ishikawa, Isao; Sawano, Yoshihiro A global universality of two-layer neural networks with ReLU activations. (English) Zbl 1480.41006 J. Funct. Spaces 2021, Article ID 6637220, 3 p. (2021). MSC: 41A30 68Q06 68T05 PDF BibTeX XML Cite \textit{N. Hatano} et al., J. Funct. Spaces 2021, Article ID 6637220, 3 p. (2021; Zbl 1480.41006) Full Text: DOI arXiv OpenURL
Takahashi, Ryo Grothendieck groups, convex cones and maximal Cohen-Macaulay points. (English) Zbl 1485.13031 Math. Z. 299, No. 1-2, 53-82 (2021). Reviewer: Prashanth Sridhar (Lawrence) MSC: 13C14 13C20 13D15 14C17 PDF BibTeX XML Cite \textit{R. Takahashi}, Math. Z. 299, No. 1--2, 53--82 (2021; Zbl 1485.13031) Full Text: DOI arXiv OpenURL
Schneck, Jakob; Weiser, Martin; Wende, Florian Impact of mixed precision and storage layout on additive Schwarz smoothers. (English) Zbl 07396249 Numer. Linear Algebra Appl. 28, No. 4, e2366, 22 p. (2021). MSC: 65N55 65Y10 65Y20 PDF BibTeX XML Cite \textit{J. Schneck} et al., Numer. Linear Algebra Appl. 28, No. 4, e2366, 22 p. (2021; Zbl 07396249) Full Text: DOI OpenURL
Alhazov, Artiom; Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Zandron, Claudio Alternative space definitions for P systems with active membranes. (English) Zbl 1469.68015 J. Membr. Comput. 3, No. 2, 87-96 (2021). MSC: 68Q07 68Q15 PDF BibTeX XML Cite \textit{A. Alhazov} et al., J. Membr. Comput. 3, No. 2, 87--96 (2021; Zbl 1469.68015) Full Text: DOI OpenURL
Menconi, Juan Manuel; Paredes, Marcelo; Sasyk, Román The inverse sieve problem for algebraic varieties over global fields. (English) Zbl 1483.11132 Rev. Mat. Iberoam. 37, No. 6, 2245-2284 (2021). Reviewer: Lenny Fukshansky (Claremont) MSC: 11G35 11G50 11N35 11N69 14Q20 PDF BibTeX XML Cite \textit{J. M. Menconi} et al., Rev. Mat. Iberoam. 37, No. 6, 2245--2284 (2021; Zbl 1483.11132) Full Text: DOI arXiv OpenURL
Sherstov, Alexander A. The hardest halfspace. (English) Zbl 07393893 Comput. Complexity 30, No. 2, Paper No. 11, 85 p. (2021). MSC: 68Q15 68Q17 PDF BibTeX XML Cite \textit{A. A. Sherstov}, Comput. Complexity 30, No. 2, Paper No. 11, 85 p. (2021; Zbl 07393893) Full Text: DOI arXiv OpenURL
Limaye, Nutan; Sreenivasaiah, Karteek; Srinivasan, Srikanth; Tripathi, Utkarsh; Venkitesh, S. A fixed-depth size-hierarchy theorem for \(\mathrm{AC}^0[\oplus]\) via the coin problem. (English) Zbl 07393745 SIAM J. Comput. 50, No. 4, 1461-1499 (2021). MSC: 68Q15 68Q17 PDF BibTeX XML Cite \textit{N. Limaye} et al., SIAM J. Comput. 50, No. 4, 1461--1499 (2021; Zbl 07393745) Full Text: DOI OpenURL
Sherstov, Alexander A.; Wu, Pei Near-optimal lower bounds on the threshold degree and sign-rank of \(AC^0\). (English) Zbl 07393741 SIAM J. Comput. 50, No. 4, STOC19-1-STOC19-86 (2021). MSC: 68Q15 68Q17 PDF BibTeX XML Cite \textit{A. A. Sherstov} and \textit{P. Wu}, SIAM J. Comput. 50, No. 4, STOC19--1-STOC19--86 (2021; Zbl 07393741) Full Text: DOI arXiv OpenURL
Hinrichs, Aicke; Prochno, Joscha; Vybíral, Jan Gelfand numbers of embeddings of Schatten classes. (English) Zbl 1480.46018 Math. Ann. 380, No. 3-4, 1563-1593 (2021). Reviewer: Andreas Defant (Oldenburg) MSC: 46B07 47B10 47B06 46B06 46B28 68Q25 PDF BibTeX XML Cite \textit{A. Hinrichs} et al., Math. Ann. 380, No. 3--4, 1563--1593 (2021; Zbl 1480.46018) Full Text: DOI arXiv OpenURL
Xu, Zhiwei; Zhang, Jialin Computational thinking: a perspective on computer science. (English) Zbl 07385350 Singapore: Springer (ISBN 978-981-16-3847-3/hbk; 978-981-16-3848-0/ebook). xxvi, 319 p. (2021). Reviewer: Dieter Riebesehl (Lüneburg) MSC: 68-01 68M01 68M11 68N15 68P05 68P10 68Q04 68Q06 68Q15 68Q25 97P10 PDF BibTeX XML Cite \textit{Z. Xu} and \textit{J. Zhang}, Computational thinking: a perspective on computer science. Singapore: Springer (2021; Zbl 07385350) Full Text: DOI OpenURL
Berg, Kevin M. The complexity of homomorphism factorization. (English) Zbl 07382711 Algebra Univers. 82, No. 3, Paper No. 47, 19 p. (2021). MSC: 68Q25 03C05 08A05 PDF BibTeX XML Cite \textit{K. M. Berg}, Algebra Univers. 82, No. 3, Paper No. 47, 19 p. (2021; Zbl 07382711) Full Text: DOI arXiv OpenURL
Kumar, Jakkepalli Pavan; Reddy, P. Venkata Subba Algorithmic aspects of secure connected domination in graphs. (English) Zbl 1468.05212 Discuss. Math., Graph Theory 41, No. 4, 1179-1197 (2021). MSC: 05C69 68Q25 68W25 PDF BibTeX XML Cite \textit{J. P. Kumar} and \textit{P. V. S. Reddy}, Discuss. Math., Graph Theory 41, No. 4, 1179--1197 (2021; Zbl 1468.05212) Full Text: DOI arXiv OpenURL
Volk, Ben Lee; Kumar, Mrinal Lower bounds for matrix factorization. (English) Zbl 07372271 Comput. Complexity 30, No. 1, Paper No. 6, 40 p. (2021). MSC: 68Q04 68Q15 68Q17 PDF BibTeX XML Cite \textit{B. L. Volk} and \textit{M. Kumar}, Comput. Complexity 30, No. 1, Paper No. 6, 40 p. (2021; Zbl 07372271) Full Text: DOI arXiv OpenURL
Abascal, Jackson; Hemaspaandra, Lane A.; Maimon, Shir; Rubery, Daniel Closure and nonclosure properties of the classes of compressible and rankable sets. (English) Zbl 07365386 J. Comput. Syst. Sci. 120, 162-176 (2021). MSC: 68Q15 PDF BibTeX XML Cite \textit{J. Abascal} et al., J. Comput. Syst. Sci. 120, 162--176 (2021; Zbl 07365386) Full Text: DOI OpenURL
Koenig, Dale; Tsvietkova, Anastasiia NP-hard problems naturally arising in knot theory. (English) Zbl 1468.57005 Trans. Am. Math. Soc., Ser. B 8, 420-441 (2021). MSC: 57K10 68Q15 68Q25 57-08 PDF BibTeX XML Cite \textit{D. Koenig} and \textit{A. Tsvietkova}, Trans. Am. Math. Soc., Ser. B 8, 420--441 (2021; Zbl 1468.57005) Full Text: DOI arXiv OpenURL
Purcell, Christopher; Rombach, Puck Role colouring graphs in hereditary classes. (English) Zbl 07362187 Theor. Comput. Sci. 876, 12-24 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{C. Purcell} and \textit{P. Rombach}, Theor. Comput. Sci. 876, 12--24 (2021; Zbl 07362187) Full Text: DOI arXiv OpenURL
Arunachalam, Srinivasan; Grilo, Alex Bredariol; Sundaram, Aarthi Quantum hardness of learning shallow classical circuits. (English) Zbl 07362093 SIAM J. Comput. 50, No. 3, 972-1013 (2021). MSC: 68Q05 68Q15 68Q32 PDF BibTeX XML Cite \textit{S. Arunachalam} et al., SIAM J. Comput. 50, No. 3, 972--1013 (2021; Zbl 07362093) Full Text: DOI arXiv OpenURL
Paradise, Orr Smooth and strong PCPs. (English) Zbl 1485.68101 Comput. Complexity 30, No. 1, Paper No. 1, 77 p. (2021); corrigendum ibid. 30, No. 1, Paper No. 9, 1 p. (2021). Reviewer: Arne Meier (Hannover) MSC: 68Q15 68Q10 68Q17 68W20 PDF BibTeX XML Cite \textit{O. Paradise}, Comput. Complexity 30, No. 1, Paper No. 1, 77 p. (2021; Zbl 1485.68101) Full Text: DOI OpenURL
Biasse, Jean-François; Bonnetain, Xavier; Pring, Benjamin; Schrottenloher, André; Youmans, William A trade-off between classical and quantum circuit size for an attack against CSIDH. (English) Zbl 1464.94028 J. Math. Cryptol. 15, 4-17 (2021). MSC: 94A60 68Q12 68Q15 81P68 11Y16 14Q05 14G50 81P94 PDF BibTeX XML Cite \textit{J.-F. Biasse} et al., J. Math. Cryptol. 15, 4--17 (2021; Zbl 1464.94028) Full Text: DOI OpenURL
Rybakov, Vladimir V. A short essay towards if P not equal NP. (English) Zbl 07334163 J. Sib. Fed. Univ., Math. Phys. 14, No. 2, 258-260 (2021). MSC: 68Q25 68Q15 PDF BibTeX XML Cite \textit{V. V. Rybakov}, J. Sib. Fed. Univ., Math. Phys. 14, No. 2, 258--260 (2021; Zbl 07334163) Full Text: DOI MNR OpenURL
Hoza, William M.; Umans, Chris Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace. (English) Zbl 07327263 SIAM J. Comput. 50, No. 1, STOC17-281-STOC17-304 (2021). MSC: 68Q15 68Q87 PDF BibTeX XML Cite \textit{W. M. Hoza} and \textit{C. Umans}, SIAM J. Comput. 50, No. 1, STOC17--281-STOC17--304 (2021; Zbl 07327263) Full Text: DOI OpenURL
Feuilloley, Laurent; Habib, Michel Graph classes and forbidden patterns on three vertices. (English) Zbl 07325840 SIAM J. Discrete Math. 35, No. 1, 55-90 (2021). MSC: 03D15 05C85 05C62 68R10 PDF BibTeX XML Cite \textit{L. Feuilloley} and \textit{M. Habib}, SIAM J. Discrete Math. 35, No. 1, 55--90 (2021; Zbl 07325840) Full Text: DOI arXiv OpenURL
Tsatsomeros, Michael J.; Zhang, Yueqiao Faith The fibre of P-matrices: the recursive construction of all matrices with positive principal minors. (English) Zbl 1461.15036 Linear Multilinear Algebra 69, No. 2, 224-232 (2021). Reviewer: Francisco Marcellán (Leganes) MSC: 15B99 15A15 15A23 68Q15 PDF BibTeX XML Cite \textit{M. J. Tsatsomeros} and \textit{Y. F. Zhang}, Linear Multilinear Algebra 69, No. 2, 224--232 (2021; Zbl 1461.15036) Full Text: DOI OpenURL
Doerr, Benjamin; Mayer, Sebastian The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. (English) Zbl 1460.65014 J. Complexity 63, Article ID 101521, 30 p. (2021). MSC: 65D15 65Y20 41A30 41A63 PDF BibTeX XML Cite \textit{B. Doerr} and \textit{S. Mayer}, J. Complexity 63, Article ID 101521, 30 p. (2021; Zbl 1460.65014) Full Text: DOI arXiv OpenURL
Deligkas, Argyrios; Fearnley, John; Melissourgos, Themistoklis; Spirakis, Paul G. Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. (English) Zbl 1477.68115 J. Comput. Syst. Sci. 117, 75-98 (2021). MSC: 68Q17 55M20 68Q15 91B32 PDF BibTeX XML Cite \textit{A. Deligkas} et al., J. Comput. Syst. Sci. 117, 75--98 (2021; Zbl 1477.68115) Full Text: DOI arXiv Link OpenURL
Aldi, Marco; de Beaudrap, Niel; Gharibian, Sevag; Saeedi, Seyran On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1462.81085 Commun. Math. Phys. 381, No. 1, 209-256 (2021). Reviewer: Eric Stachura (Marietta) MSC: 81Q10 81P68 68Q15 35P05 82B20 81P65 PDF BibTeX XML Cite \textit{M. Aldi} et al., Commun. Math. Phys. 381, No. 1, 209--256 (2021; Zbl 1462.81085) Full Text: DOI OpenURL
Zdanowski, Konrad Truth definition for \(\Delta_0\) formulas and PSPACE computations. (English) Zbl 07301046 Fundam. Math. 252, No. 1, 1-38 (2021). MSC: 03F30 03F35 68Q15 PDF BibTeX XML Cite \textit{K. Zdanowski}, Fundam. Math. 252, No. 1, 1--38 (2021; Zbl 07301046) Full Text: DOI OpenURL
Brattka, Vasco; Gherardi, Guido Completion of choice. (English) Zbl 1462.03019 Ann. Pure Appl. Logic 172, No. 3, Article ID 102914, 31 p. (2021). Reviewer: Jeffry L. Hirst (Boone) MSC: 03D78 03B30 03D30 03F60 03F35 PDF BibTeX XML Cite \textit{V. Brattka} and \textit{G. Gherardi}, Ann. Pure Appl. Logic 172, No. 3, Article ID 102914, 31 p. (2021; Zbl 1462.03019) Full Text: DOI arXiv OpenURL
Durand, Arnaud; Haak, Anselm; Kontinen, Juha; Vollmer, Heribert Descriptive complexity of #P functions: a new perspective. (English) Zbl 1467.68060 J. Comput. Syst. Sci. 116, 40-54 (2021). MSC: 68Q19 68Q06 PDF BibTeX XML Cite \textit{A. Durand} et al., J. Comput. Syst. Sci. 116, 40--54 (2021; Zbl 1467.68060) Full Text: DOI Link OpenURL
Bodirsky, Manuel; Mottet, Antoine; Olšák, Miroslav; Opršal, Jakub; Pinsker, Michael; Willard, Ross \( \omega \)-categorical structures avoiding height 1 identities. (English) Zbl 1472.08006 Trans. Am. Math. Soc. 374, No. 1, 327-350 (2021). Reviewer: Keith Kearnes (Boulder) MSC: 08B05 03C05 08A70 03C10 03D15 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., Trans. Am. Math. Soc. 374, No. 1, 327--350 (2021; Zbl 1472.08006) Full Text: DOI arXiv OpenURL
Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank Computable irrational numbers with representations of surprising complexity. (English) Zbl 1481.03041 Ann. Pure Appl. Logic 172, No. 2, Article ID 102893, 30 p. (2021). Reviewer: Matteo Bianchetti (Notre Dame) MSC: 03D78 03D20 03F60 03D15 PDF BibTeX XML Cite \textit{I. Georgiev} et al., Ann. Pure Appl. Logic 172, No. 2, Article ID 102893, 30 p. (2021; Zbl 1481.03041) Full Text: DOI OpenURL
Pudlák, Pavel The canonical pairs of bounded depth Frege systems. (English) Zbl 07285678 Ann. Pure Appl. Logic 172, No. 2, Article ID 102892, 42 p. (2021). MSC: 03B05 03B70 03D15 68Q06 68Q15 PDF BibTeX XML Cite \textit{P. Pudlák}, Ann. Pure Appl. Logic 172, No. 2, Article ID 102892, 42 p. (2021; Zbl 07285678) Full Text: DOI arXiv OpenURL
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo Gathering robots in graphs: the central role of synchronicity. (English) Zbl 1464.68440 Theor. Comput. Sci. 849, 99-120 (2021). MSC: 68W15 68Q25 68R10 68T40 PDF BibTeX XML Cite \textit{S. Cicerone} et al., Theor. Comput. Sci. 849, 99--120 (2021; Zbl 1464.68440) Full Text: DOI OpenURL
Saakian, David B.; Cheong, Kang Hao A modified Crow-Kimura evolution model with reduced fitness for the smooth distribution of population. (English) Zbl 07527207 Physica A 544, Article ID 123292, 10 p. (2020). MSC: 82-XX PDF BibTeX XML Cite \textit{D. B. Saakian} and \textit{K. H. Cheong}, Physica A 544, Article ID 123292, 10 p. (2020; Zbl 07527207) Full Text: DOI OpenURL
Ganian, Robert; de Haan, Ronald; Kanj, Iyad; Szeider, Stefan On existential MSO and its relation to ETH. (English) Zbl 07485438 ACM Trans. Comput. Theory 12, No. 4, Article No. 22, 32 p. (2020). MSC: 68Q15 PDF BibTeX XML Cite \textit{R. Ganian} et al., ACM Trans. Comput. Theory 12, No. 4, Article No. 22, 32 p. (2020; Zbl 07485438) Full Text: DOI OpenURL
Meeks, Kitty Book review of: J. MacCormick, What can be computed? A practical guide to the theory of computation. (English) Zbl 1480.00030 Lond. Math. Soc., Newsl. 2020, No. 490, 50-51 (2020). MSC: 00A17 68-01 68N15 68Q01 68Q04 68Q15 68Q17 68Q25 68Q45 PDF BibTeX XML Cite \textit{K. Meeks}, Lond. Math. Soc., Newsl. 2020, No. 490, 50--51 (2020; Zbl 1480.00030) Full Text: Link OpenURL
Orellana-Martín, David; Riscos-Núñez, Agustín Seeking computational efficiency boundaries: the Păun’s conjecture. (English) Zbl 1469.68050 J. Membr. Comput. 2, No. 4, 323-331 (2020). MSC: 68Q07 68Q15 PDF BibTeX XML Cite \textit{D. Orellana-Martín} and \textit{A. Riscos-Núñez}, J. Membr. Comput. 2, No. 4, 323--331 (2020; Zbl 1469.68050) Full Text: DOI OpenURL
Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio Simulating counting oracles with cooperation. (English) Zbl 1469.68044 J. Membr. Comput. 2, No. 4, 303-310 (2020). MSC: 68Q07 68Q15 PDF BibTeX XML Cite \textit{A. Leporati} et al., J. Membr. Comput. 2, No. 4, 303--310 (2020; Zbl 1469.68044) Full Text: DOI OpenURL
Pavan Kumar, J.; Reddy, P. Venkata Subba Algorithmic aspects of some variants of domination in graphs. (English) Zbl 07376181 An. Științ. Univ. “Ovidius” Constanța, Ser. Mat. 28, No. 3, 153-170 (2020). MSC: 05C69 68Q17 05C85 PDF BibTeX XML Cite \textit{J. Pavan Kumar} and \textit{P. V. S. Reddy}, An. Științ. Univ. ``Ovidius'' Constanța, Ser. Mat. 28, No. 3, 153--170 (2020; Zbl 07376181) Full Text: DOI arXiv OpenURL
Smith, Taylor J.; Salomaa, Kai Recognition and complexity results for projection languages of two-dimensional automata. (English) Zbl 07371301 Jirásková, Galina (ed.) et al., Descriptional complexity of formal systems. 22nd international conference, DCFS 2020, Vienna, Austria, August 24–26, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12442, 206-218 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{T. J. Smith} and \textit{K. Salomaa}, Lect. Notes Comput. Sci. 12442, 206--218 (2020; Zbl 07371301) Full Text: DOI arXiv OpenURL
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Spakowski, Holger; Watanabe, Osamu The robustness of LWPP and WPP, with an application to graph reconstruction. (English) Zbl 07350835 Comput. Complexity 29, No. 2, Paper No. 7, 49 p. (2020). MSC: 68Q15 PDF BibTeX XML Cite \textit{E. Hemaspaandra} et al., Comput. Complexity 29, No. 2, Paper No. 7, 49 p. (2020; Zbl 07350835) Full Text: DOI Link OpenURL
Shchesnovich, V. S. On the classical complexity of sampling from quantum interference of indistinguishable bosons. (English) Zbl 1461.81149 Int. J. Quantum Inf. 18, No. 7, Article ID 2050044, 16 p. (2020). MSC: 81V73 81V80 81P68 68Q12 68Q15 PDF BibTeX XML Cite \textit{V. S. Shchesnovich}, Int. J. Quantum Inf. 18, No. 7, Article ID 2050044, 16 p. (2020; Zbl 1461.81149) Full Text: DOI arXiv OpenURL
Dvir, Zeev; Liu, Allen Fourier and circulant matrices are not rigid. (English) Zbl 1477.68117 Theory Comput. 16, Paper No. 20, 48 p. (2020). MSC: 68Q17 15B99 68Q06 68Q15 68R05 PDF BibTeX XML Cite \textit{Z. Dvir} and \textit{A. Liu}, Theory Comput. 16, Paper No. 20, 48 p. (2020; Zbl 1477.68117) Full Text: DOI arXiv OpenURL
Loomis, Samuel P.; Mahoney, John R.; Aghamohammadi, Cina; Crutchfield, James P. Optimizing quantum models of classical channels: the reverse Holevo problem. (English) Zbl 1460.81010 J. Stat. Phys. 181, No. 5, 1966-1985 (2020). MSC: 81P47 94A40 81P45 81P40 68Q15 PDF BibTeX XML Cite \textit{S. P. Loomis} et al., J. Stat. Phys. 181, No. 5, 1966--1985 (2020; Zbl 1460.81010) Full Text: DOI arXiv OpenURL
Dean, Walter Erratum to: “Computational complexity theory and the philosophy of mathematics”. (English) Zbl 1453.68085 Philos. Math. (3) 28, No. 2, 290 (2020). MSC: 68Q15 00A30 PDF BibTeX XML Cite \textit{W. Dean}, Philos. Math. (3) 28, No. 2, 290 (2020; Zbl 1453.68085) Full Text: DOI OpenURL
Gordeev, Lew; Haeusler, Edward Hermann Proof compression and NP versus PSPACE. II. (English) Zbl 1477.03246 Bull. Sect. Log., Univ. Łódź, Dep. Log. 49, No. 3, 213-230 (2020). MSC: 03F20 03D15 68Q15 PDF BibTeX XML Cite \textit{L. Gordeev} and \textit{E. H. Haeusler}, Bull. Sect. Log., Univ. Łódź, Dep. Log. 49, No. 3, 213--230 (2020; Zbl 1477.03246) Full Text: DOI OpenURL
Norman, Matthew; Larkin, Jeffrey A holistic algorithmic approach to improving accuracy, robustness, and computational efficiency for atmospheric dynamics. (English) Zbl 1459.35356 SIAM J. Sci. Comput. 42, No. 5, B1302-B1327 (2020). MSC: 35Q86 86A10 86A08 86-08 35Q30 68W10 65Y20 65Y10 PDF BibTeX XML Cite \textit{M. Norman} and \textit{J. Larkin}, SIAM J. Sci. Comput. 42, No. 5, B1302--B1327 (2020; Zbl 1459.35356) Full Text: DOI OpenURL
Hubáček, Pavel; Yogev, Eylon Hardness of continuous local search: query complexity and cryptographic lower bounds. (English) Zbl 07282217 SIAM J. Comput. 49, No. 6, 1128-1172 (2020). MSC: 68Q15 68Q17 PDF BibTeX XML Cite \textit{P. Hubáček} and \textit{E. Yogev}, SIAM J. Comput. 49, No. 6, 1128--1172 (2020; Zbl 07282217) Full Text: DOI OpenURL
Savitskii, I. V. Arithmetization of register machines with counters. (English. Russian original) Zbl 1477.03160 Mosc. Univ. Comput. Math. Cybern. 44, No. 3, 133-145 (2020); translation from Vestn. Mosk. Univ., Ser. XV 2020, No. 3, 30-42 (2020). MSC: 03D15 03D20 68Q15 PDF BibTeX XML Cite \textit{I. V. Savitskii}, Mosc. Univ. Comput. Math. Cybern. 44, No. 3, 133--145 (2020; Zbl 1477.03160); translation from Vestn. Mosk. Univ., Ser. XV 2020, No. 3, 30--42 (2020) Full Text: DOI OpenURL
Ambartsumyan, Ilona; Boukaram, Wajih; Bui-Thanh, Tan; Ghattas, Omar; Keyes, David; Stadler, Georg; Turkiyyah, George; Zampini, Stefano Hierarchical matrix approximations of Hessians arising in inverse problems governed by PDEs. (English) Zbl 1453.65289 SIAM J. Sci. Comput. 42, No. 5, A3397-A3426 (2020). Reviewer: Alain Brillard (Riedisheim) MSC: 65M32 35Q93 49M25 49N45 65F10 65F99 65Y05 65Y10 78A46 PDF BibTeX XML Cite \textit{I. Ambartsumyan} et al., SIAM J. Sci. Comput. 42, No. 5, A3397--A3426 (2020; Zbl 1453.65289) Full Text: DOI arXiv OpenURL
Dose, Titus Further oracles separating conjectures about incompleteness in the finite domain. (English) Zbl 1485.03236 Theor. Comput. Sci. 847, 76-94 (2020). MSC: 03F20 68Q15 PDF BibTeX XML Cite \textit{T. Dose}, Theor. Comput. Sci. 847, 76--94 (2020; Zbl 1485.03236) Full Text: DOI OpenURL
Parrilo, Pablo A. (ed.); Thomas, Rekha R. (ed.) Sum of squares: theory and applications. AMS short course, Baltimore, MD, USA, January 14–15, 2019. (English) Zbl 1451.11010 Proceedings of Symposia in Applied Mathematics 77. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-5025-0/pbk; 978-1-4704-6040-2/ebook). vii, 142 p. (2020). MSC: 11-06 11E25 14P05 68Q15 00B25 PDF BibTeX XML Cite \textit{P. A. Parrilo} (ed.) and \textit{R. R. Thomas} (ed.), Sum of squares: theory and applications. AMS short course, Baltimore, MD, USA, January 14--15, 2019. Providence, RI: American Mathematical Society (AMS) (2020; Zbl 1451.11010) Full Text: DOI OpenURL
Das, Anupam From QBFs to MALL and back via focussing. (English) Zbl 1468.68104 J. Autom. Reasoning 64, No. 7, 1221-1245 (2020). MSC: 68Q15 03F20 03F52 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Das}, J. Autom. Reasoning 64, No. 7, 1221--1245 (2020; Zbl 1468.68104) Full Text: DOI OpenURL
Murray, Cody D.; Williams, R. Ryan Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma. (English) Zbl 07268367 SIAM J. Comput. 49, No. 5, STOC18-300-STOC18-322 (2020). MSC: 68Q25 68Q06 68Q15 68Q17 PDF BibTeX XML Cite \textit{C. D. Murray} and \textit{R. R. Williams}, SIAM J. Comput. 49, No. 5, STOC18--300-STOC18--322 (2020; Zbl 07268367) Full Text: DOI OpenURL
Kel’manov, A. V.; Pyatkin, A. V.; Khandeev, V. I. Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters. (English. Russian original) Zbl 1451.62074 Comput. Math. Math. Phys. 60, No. 1, 163-170 (2020); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 1, 151-158 (2020). MSC: 62H30 68Q15 52C35 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Comput. Math. Math. Phys. 60, No. 1, 163--170 (2020; Zbl 1451.62074); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 1, 151--158 (2020) Full Text: DOI OpenURL
Valencia-Cabrera, Luis; Orellana-Martín, David; Martínez-del-Amor, Miguel Á.; Pérez-Hurtado, Ignacio; Pérez-Jiménez, Mario J. From NP-completeness to DP-completeness: a membrane computing perspective. (English) Zbl 1445.68094 Complexity 2020, Article ID 6765097, 10 p. (2020). MSC: 68Q07 68Q15 68Q17 PDF BibTeX XML Cite \textit{L. Valencia-Cabrera} et al., Complexity 2020, Article ID 6765097, 10 p. (2020; Zbl 1445.68094) Full Text: DOI OpenURL
Basu, Saugata; Patel, Deepam Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda’s theorem. (English) Zbl 1456.14024 Sel. Math., New Ser. 26, No. 5, Paper No. 71, 45 p. (2020). MSC: 14F20 14F25 68Q15 03C10 11T23 PDF BibTeX XML Cite \textit{S. Basu} and \textit{D. Patel}, Sel. Math., New Ser. 26, No. 5, Paper No. 71, 45 p. (2020; Zbl 1456.14024) Full Text: DOI arXiv OpenURL
Jeřábek, Emil Rules with parameters in modal logic. II. (English) Zbl 1472.03016 Ann. Pure Appl. Logic 171, No. 10, Article ID 102829, 59 p. (2020). Reviewer: Ernst-Erich Doberkat (Dortmund) MSC: 03B45 68Q17 68Q15 03D15 PDF BibTeX XML Cite \textit{E. Jeřábek}, Ann. Pure Appl. Logic 171, No. 10, Article ID 102829, 59 p. (2020; Zbl 1472.03016) Full Text: DOI arXiv OpenURL
De La Rosa-Navarro, Brenda Leticia; Frías-Medina, Juan Bosco; Lahyane, Mustapha Platonic Harbourne-Hirschowitz rational surfaces. (English) Zbl 1444.14067 Mediterr. J. Math. 17, No. 5, Paper No. 154, 21 p. (2020). Reviewer: Piotr Pokora (Kraków) MSC: 14J26 14C20 14C22 14C17 14Q20 PDF BibTeX XML Cite \textit{B. L. De La Rosa-Navarro} et al., Mediterr. J. Math. 17, No. 5, Paper No. 154, 21 p. (2020; Zbl 1444.14067) Full Text: DOI OpenURL
Fearnley, John; Gordon, Spencer; Mehta, Ruta; Savani, Rahul Unique end of potential line. (English) Zbl 1461.68086 J. Comput. Syst. Sci. 114, 1-35 (2020). MSC: 68Q15 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. Fearnley} et al., J. Comput. Syst. Sci. 114, 1--35 (2020; Zbl 1461.68086) Full Text: DOI arXiv Link OpenURL
Bouland, Adam; Chen, Lijie; Holden, Dhiraj; Thaler, Justin; Vasudevan, Prashant Nalini On the power of statistical zero knowledge. (English) Zbl 1452.68081 SIAM J. Comput. 49, No. 4, FOCS17-1-FOCS17-58 (2020). MSC: 68Q15 68Q10 68Q11 68Q17 68W20 PDF BibTeX XML Cite \textit{A. Bouland} et al., SIAM J. Comput. 49, No. 4, FOCS17--1-FOCS17--58 (2020; Zbl 1452.68081) Full Text: DOI arXiv OpenURL
Bun, Mark; Thaler, Justin A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\). (English) Zbl 1471.68092 SIAM J. Comput. 49, No. 4, FOCS17-59-FOCS17-96 (2020). Reviewer: Peter Kostolányi (Bratislava) MSC: 68Q06 68Q11 68Q15 68Q17 94A62 PDF BibTeX XML Cite \textit{M. Bun} and \textit{J. Thaler}, SIAM J. Comput. 49, No. 4, FOCS17--59-FOCS17--96 (2020; Zbl 1471.68092) Full Text: DOI arXiv OpenURL
Göös, Mika; Pitassi, Toniann; Watson, Thomas Query-to-communication lifting for BPP. (English) Zbl 1440.68092 SIAM J. Comput. 49, No. 4, FOCS17-441-FOCS17-461 (2020). MSC: 68Q11 68Q15 68Q17 PDF BibTeX XML Cite \textit{M. Göös} et al., SIAM J. Comput. 49, No. 4, FOCS17--441-FOCS17--461 (2020; Zbl 1440.68092) Full Text: DOI arXiv OpenURL
Basu, Saugata; Isik, Umut Categorical complexity. (English) Zbl 1452.18001 Forum Math. Sigma 8, Paper No. e34, 63 p. (2020). Reviewer: Philippe Gaucher (Paris) MSC: 18A10 68Q15 14Q20 PDF BibTeX XML Cite \textit{S. Basu} and \textit{U. Isik}, Forum Math. Sigma 8, Paper No. e34, 63 p. (2020; Zbl 1452.18001) Full Text: DOI arXiv OpenURL
Dörfler, Julian; Ikenmeyer, Christian; Panova, Greta On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions. (English) Zbl 1455.68069 SIAM J. Appl. Algebra Geom. 4, No. 2, 354-376 (2020). MSC: 68Q15 05E10 14N07 14Q20 PDF BibTeX XML Cite \textit{J. Dörfler} et al., SIAM J. Appl. Algebra Geom. 4, No. 2, 354--376 (2020; Zbl 1455.68069) Full Text: DOI arXiv OpenURL
Meir, Or Toward better depth lower bounds: two results on the multiplexor relation. (English) Zbl 1452.68085 Comput. Complexity 29, No. 1, Paper No. 4, 25 p. (2020). MSC: 68Q17 68Q06 68Q11 68Q15 PDF BibTeX XML Cite \textit{O. Meir}, Comput. Complexity 29, No. 1, Paper No. 4, 25 p. (2020; Zbl 1452.68085) Full Text: DOI OpenURL
Kuznetsov, Vitaly; Mohri, Mehryar Discrepancy-based theory and algorithms for forecasting non-stationary time series. (English) Zbl 1452.62654 Ann. Math. Artif. Intell. 88, No. 4, 367-399 (2020). MSC: 62M10 62M20 62L10 68T05 68Q15 PDF BibTeX XML Cite \textit{V. Kuznetsov} and \textit{M. Mohri}, Ann. Math. Artif. Intell. 88, No. 4, 367--399 (2020; Zbl 1452.62654) Full Text: DOI OpenURL
Montealegre, P.; Perez-Salazar, S.; Rapaport, I.; Todinca, I. Graph reconstruction in the congested clique. (English) Zbl 1444.68151 J. Comput. Syst. Sci. 113, 1-17 (2020). MSC: 68R10 05C69 68W15 68W40 PDF BibTeX XML Cite \textit{P. Montealegre} et al., J. Comput. Syst. Sci. 113, 1--17 (2020; Zbl 1444.68151) Full Text: DOI arXiv OpenURL
Choudhury, Projesh Nath; Tsatsomeros, Michael J. Algorithmic detection and construction of N-matrices. (English) Zbl 1441.15023 Linear Algebra Appl. 602, 46-56 (2020). Reviewer: K. C. Sivakumar (Chennai) MSC: 15B48 15A15 15A23 68Q15 90C33 PDF BibTeX XML Cite \textit{P. N. Choudhury} and \textit{M. J. Tsatsomeros}, Linear Algebra Appl. 602, 46--56 (2020; Zbl 1441.15023) Full Text: DOI arXiv OpenURL
Mazzanti, Stefano New substitution bases for complexity classes. (English) Zbl 1455.03051 Math. Log. Q. 66, No. 1, 37-50 (2020). Reviewer: Arne Meier (Hannover) MSC: 03D15 68Q15 PDF BibTeX XML Cite \textit{S. Mazzanti}, Math. Log. Q. 66, No. 1, 37--50 (2020; Zbl 1455.03051) Full Text: DOI Link OpenURL
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M. Subgraph complementation. (English) Zbl 1439.05212 Algorithmica 82, No. 7, 1859-1880 (2020). MSC: 05C85 05C75 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Algorithmica 82, No. 7, 1859--1880 (2020; Zbl 1439.05212) Full Text: DOI arXiv OpenURL
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin; Fernau, Henning Domination chain: characterisation, classical complexity, parameterised complexity and approximability. (English) Zbl 1439.05174 Discrete Appl. Math. 280, 23-42 (2020). MSC: 05C69 05C10 05C85 68Q17 68Q27 PDF BibTeX XML Cite \textit{C. Bazgan} et al., Discrete Appl. Math. 280, 23--42 (2020; Zbl 1439.05174) Full Text: DOI OpenURL
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations. (English) Zbl 1437.90157 Math. Oper. Res. 45, No. 1, 34-62 (2020). MSC: 90C40 60J80 68Q25 90C53 68Q15 68Q17 PDF BibTeX XML Cite \textit{K. Etessami} et al., Math. Oper. Res. 45, No. 1, 34--62 (2020; Zbl 1437.90157) Full Text: DOI arXiv OpenURL