Marturano, Perpaolo Quantum computing. A developer’s guide (to appear). (English) Zbl 07204916 De Gruyter Textbook. Berlin: De Gruyter/ Oldenbourg (ISBN 978-3-11-063675-8/pbk; 978-3-11-063679-6/ebook). xx, 200 p. (2022). MSC: 68-01 81-01 68Q09 68Q12 81P68 PDF BibTeX XML Cite \textit{P. Marturano}, Quantum computing. A developer's guide (to appear). Berlin: De Gruyter/ Oldenbourg (2022; Zbl 07204916)
Szegedy, Mario; Newman, Ilan; Lee, Troy Query complexity (to appear). (English) Zbl 07177078 Hackensack, NJ: World Scientific (ISBN 978-981-322-320-2/hbk). 200 p. (2022). MSC: 68-02 68P05 68Q25 68R05 68W20 PDF BibTeX XML Cite \textit{M. Szegedy} et al., Query complexity (to appear). Hackensack, NJ: World Scientific (2022; Zbl 07177078) Full Text: DOI
Halldórsson, Magnús M.; Tonoyan, Tigran Effective wireless scheduling via hypergraph sketches. (English) Zbl 07333151 SIAM J. Comput. 50, No. 2, 718-759 (2021). MSC: 68Q25 68R10 68M10 PDF BibTeX XML Cite \textit{M. M. Halldórsson} and \textit{T. Tonoyan}, SIAM J. Comput. 50, No. 2, 718--759 (2021; Zbl 07333151) Full Text: DOI
Huang, Dawei; Pettie, Seth; Zhang, Yixiang; Zhang, Zhijun The communication complexity of set intersection and multiple equality testing. (English) Zbl 07333150 SIAM J. Comput. 50, No. 2, 674-717 (2021). MSC: 94A05 68R05 60Cxx PDF BibTeX XML Cite \textit{D. Huang} et al., SIAM J. Comput. 50, No. 2, 674--717 (2021; Zbl 07333150) Full Text: DOI
Okrasa, Karolina; Rzaͅżewski, Paweł Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs. (English) Zbl 07333144 SIAM J. Comput. 50, No. 2, 487-508 (2021). MSC: 68Q25 05C85 05C60 68R10 PDF BibTeX XML Cite \textit{K. Okrasa} and \textit{P. Rzaͅżewski}, SIAM J. Comput. 50, No. 2, 487--508 (2021; Zbl 07333144) Full Text: DOI
Asahiro, Yuichi; Eto, Hiroshi; Hanaka, Tesshu; Lin, Guohui; Miyano, Eiji; Terabaru, Ippei Complexity and approximability of the happy set problem. (English) Zbl 07333011 Theor. Comput. Sci. 866, 123-144 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{Y. Asahiro} et al., Theor. Comput. Sci. 866, 123--144 (2021; Zbl 07333011) Full Text: DOI
Junges, Sebastian; Katoen, Joost-Pieter; Pérez, Guillermo A.; Winkler, Tobias The complexity of reachability in parametric Markov decision processes. (English) Zbl 07332998 J. Comput. Syst. Sci. 119, 183-210 (2021). MSC: 68 PDF BibTeX XML Cite \textit{S. Junges} et al., J. Comput. Syst. Sci. 119, 183--210 (2021; Zbl 07332998) Full Text: DOI
Ferrarotti, Flavio; González, Senén; Turull Torres, José María; Van den Bussche, Jan; Virtema, Jonni Descriptive complexity of deterministic polylogarithmic time and space. (English) Zbl 07332996 J. Comput. Syst. Sci. 119, 145-163 (2021). MSC: 68 PDF BibTeX XML Cite \textit{F. Ferrarotti} et al., J. Comput. Syst. Sci. 119, 145--163 (2021; Zbl 07332996) Full Text: DOI
Eiben, Eduard; Lokshtanov, Daniel; Mouawad, Amer E. Bisection of bounded treewidth graphs by convolutions. (English) Zbl 07332994 J. Comput. Syst. Sci. 119, 125-132 (2021). MSC: 68 PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 119, 125--132 (2021; Zbl 07332994) Full Text: DOI
Park, Junpyo; Jang, Bongsoo Structural stability of coexistence in evolutionary dynamics of cyclic competition. (English) Zbl 07332971 Appl. Math. Comput. 394, Article ID 125794, 11 p. (2021). MSC: 37N 92D 34C PDF BibTeX XML Cite \textit{J. Park} and \textit{B. Jang}, Appl. Math. Comput. 394, Article ID 125794, 11 p. (2021; Zbl 07332971) Full Text: DOI
Rêgo, Leandro Chaves; Silva, Hugo Victor; Rodrigues, Carlos Diego Optimizing the cost of preference manipulation in the graph model for conflict resolution. (English) Zbl 07332916 Appl. Math. Comput. 392, Article ID 125729, 12 p. (2021). MSC: 68U 90B 68T PDF BibTeX XML Cite \textit{L. C. Rêgo} et al., Appl. Math. Comput. 392, Article ID 125729, 12 p. (2021; Zbl 07332916) Full Text: DOI
Hadji, Amine; Szabó, Botond Can we trust Bayesian uncertainty quantification from Gaussian process priors with squared exponential covariance kernel? (English) Zbl 07332578 SIAM/ASA J. Uncertain. Quantif. 9, 185-230 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{A. Hadji} and \textit{B. Szabó}, SIAM/ASA J. Uncertain. Quantif. 9, 185--230 (2021; Zbl 07332578) Full Text: DOI
Tanaka, Kohei Simplicial approximation and refinement of monoidal topological complexity. (English) Zbl 07332542 Proc. Am. Math. Soc. 149, No. 4, 1801-1815 (2021). MSC: 55M30 55P10 55U10 05E45 PDF BibTeX XML Cite \textit{K. Tanaka}, Proc. Am. Math. Soc. 149, No. 4, 1801--1815 (2021; Zbl 07332542) Full Text: DOI
Rybakov, Mikhail; Shkatov, Dmitry Complexity of finite-variable fragments of products with K. (English) Zbl 07332113 J. Log. Comput. 31, No. 2, 426-443 (2021). MSC: 03 68 PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, J. Log. Comput. 31, No. 2, 426--443 (2021; Zbl 07332113) Full Text: DOI
Coudron, Matthew; Stark, Jalex; Vidick, Thomas Trading locality for time: certifiable randomness from low-depth circuits. (English) Zbl 07331839 Commun. Math. Phys. 382, No. 1, 49-86 (2021). MSC: 03D 68Q 81P 81P68 68Q12 03D28 68Q04 PDF BibTeX XML Cite \textit{M. Coudron} et al., Commun. Math. Phys. 382, No. 1, 49--86 (2021; Zbl 07331839) Full Text: DOI
Harvey, David; van der Hoeven, Joris Integer multiplication in time \(O(n\log n)\). (English) Zbl 07331716 Ann. Math. (2) 193, No. 2, 563-617 (2021). MSC: 11Y16 68W30 PDF BibTeX XML Cite \textit{D. Harvey} and \textit{J. van der Hoeven}, Ann. Math. (2) 193, No. 2, 563--617 (2021; Zbl 07331716) Full Text: DOI
Feldman, Moran Guess free maximization of submodular and linear sums. (English) Zbl 07331687 Algorithmica 83, No. 3, 853-878 (2021). MSC: 68W25 68Q25 90C27 PDF BibTeX XML Cite \textit{M. Feldman}, Algorithmica 83, No. 3, 853--878 (2021; Zbl 07331687) Full Text: DOI
Boyar, Joan; Favrholdt, Lene Monrad; Kamali, Shahin; Larsen, Kim Skak Online bin covering with advice. (English) Zbl 07331685 Algorithmica 83, No. 3, 795-821 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{J. Boyar} et al., Algorithmica 83, No. 3, 795--821 (2021; Zbl 07331685) Full Text: DOI
van der Sande, Kiera; Fornberg, Bengt Fast variable density 3-D node generation. (English) Zbl 07331666 SIAM J. Sci. Comput. 43, No. 1, A242-A257 (2021). MSC: 65N99 65Y20 65M70 PDF BibTeX XML Cite \textit{K. van der Sande} and \textit{B. Fornberg}, SIAM J. Sci. Comput. 43, No. 1, A242--A257 (2021; Zbl 07331666) Full Text: DOI
Huang, Bingru; Chen, Falai Computing \(\mu\)-bases of univariate polynomial matrices using polynomial matrix factorization. (English) Zbl 07331609 J. Syst. Sci. Complex. 34, No. 3, 1189-1206 (2021). MSC: 68 PDF BibTeX XML Cite \textit{B. Huang} and \textit{F. Chen}, J. Syst. Sci. Complex. 34, No. 3, 1189--1206 (2021; Zbl 07331609) Full Text: DOI
Jin, Kai; Cheng, Jinsan On the complexity of computing the topology of real algebraic space curves. (English) Zbl 07331588 J. Syst. Sci. Complex. 34, No. 2, 809-826 (2021). MSC: 65 PDF BibTeX XML Cite \textit{K. Jin} and \textit{J. Cheng}, J. Syst. Sci. Complex. 34, No. 2, 809--826 (2021; Zbl 07331588) Full Text: DOI
Çiftçi, Canan Complexity and bounds for disjunctive total bondage. (English) Zbl 07331470 Theor. Comput. Sci. 865, 44-51 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{C. Çiftçi}, Theor. Comput. Sci. 865, 44--51 (2021; Zbl 07331470) Full Text: DOI
Hasanzadeh, Mehran; Alizadeh, Behrooz; Baroughi, Fahimeh The cardinality constrained inverse center location problems on tree networks with edge length augmentation. (English) Zbl 07331468 Theor. Comput. Sci. 865, 12-33 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{M. Hasanzadeh} et al., Theor. Comput. Sci. 865, 12--33 (2021; Zbl 07331468) Full Text: DOI
Durand, Martin; Pascual, Fanny Efficiency and equity in the multi organization scheduling problem. (English) Zbl 07331461 Theor. Comput. Sci. 864, 103-117 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{M. Durand} and \textit{F. Pascual}, Theor. Comput. Sci. 864, 103--117 (2021; Zbl 07331461) Full Text: DOI
Liu, Xianmin; Li, Jianzhong; Li, Yingshu; Feng, Yuqiang Parameterized complexity of completeness reasoning for conjunctive queries. (English) Zbl 07331455 Theor. Comput. Sci. 864, 34-49 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{X. Liu} et al., Theor. Comput. Sci. 864, 34--49 (2021; Zbl 07331455) Full Text: DOI
de Mattos, Denise; dos Santos, Edivaldo L.; Silva, Nelson Antonio On the length of cohomology spheres. (English) Zbl 07331378 Topology Appl. 293, Article ID 107569, 11 p. (2021). Reviewer: Mahender Singh (Sahibzada Ajit Singh Nagar) MSC: 55M10 55M30 55N91 PDF BibTeX XML Cite \textit{D. de Mattos} et al., Topology Appl. 293, Article ID 107569, 11 p. (2021; Zbl 07331378) Full Text: DOI
Rosen, Alon; Segev, Gil; Shahaf, Ido Can PPAD hardness be based on standard cryptographic assumptions? (English) Zbl 07331357 J. Cryptology 34, No. 1, Paper No. 8, 65 p. (2021). MSC: 94A60 94A62 68Q25 PDF BibTeX XML Cite \textit{A. Rosen} et al., J. Cryptology 34, No. 1, Paper No. 8, 65 p. (2021; Zbl 07331357) Full Text: DOI
Bugg, Caleb; Aswani, Anil Logarithmic sample bounds for sample average approximation with capacity- or budget-constraints. (English) Zbl 07331258 Oper. Res. Lett. 49, No. 2, 231-238 (2021). MSC: 90 PDF BibTeX XML Cite \textit{C. Bugg} and \textit{A. Aswani}, Oper. Res. Lett. 49, No. 2, 231--238 (2021; Zbl 07331258) Full Text: DOI
Donoso, Sebastián; Durand, Fabien; Maass, Alejandro; Petite, Samuel Interplay between finite topological rank minimal Cantor systems, \( \mathcal S\)-adic subshifts and their complexity. (English) Zbl 07331127 Trans. Am. Math. Soc. 374, No. 5, 3453-3489 (2021). MSC: 37B10 68R15 PDF BibTeX XML Cite \textit{S. Donoso} et al., Trans. Am. Math. Soc. 374, No. 5, 3453--3489 (2021; Zbl 07331127) Full Text: DOI
Lipton, Richard J.; Regan, Kenneth W. Introduction to quantum algorithms via linear algebra (to appear). 2nd edition. (English) Zbl 07330881 Cambridge, MA: MIT Press (ISBN 978-0-262-04525-4/hbk). 280 p. (2021). MSC: 68-01 68Q12 81P68 PDF BibTeX XML Cite \textit{R. J. Lipton} and \textit{K. W. Regan}, Introduction to quantum algorithms via linear algebra (to appear). 2nd edition. Cambridge, MA: MIT Press (2021; Zbl 07330881)
Agress, Daniel J.; Guidotti, Patrick Q. The smooth extension embedding method. (English) Zbl 07330823 SIAM J. Sci. Comput. 43, No. 1, A446-A471 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{D. J. Agress} and \textit{P. Q. Guidotti}, SIAM J. Sci. Comput. 43, No. 1, A446--A471 (2021; Zbl 07330823) Full Text: DOI
Alishahiha, Mohsen; Babaei Velni, Komeil; Reza Tanhayi, Mohammad Complexity and near extremal charged black branes. (English) Zbl 07330288 Ann. Phys. 425, Article ID 168398, 15 p. (2021). MSC: 81T30 81T35 83C57 PDF BibTeX XML Cite \textit{M. Alishahiha} et al., Ann. Phys. 425, Article ID 168398, 15 p. (2021; Zbl 07330288) Full Text: DOI
Maddison, Chris J.; Paulin, Daniel; Teh, Yee Whye; Doucet, Arnaud Dual space preconditioning for gradient descent. (English) Zbl 07330008 SIAM J. Optim. 31, No. 1, 991-1016 (2021). MSC: 90C25 65K05 68Q25 49M29 PDF BibTeX XML Cite \textit{C. J. Maddison} et al., SIAM J. Optim. 31, No. 1, 991--1016 (2021; Zbl 07330008) Full Text: DOI
Moorman, Jacob D.; Tu, Thomas K.; Molitor, Denali; Needell, Deanna Randomized Kaczmarz with averaging. (English) Zbl 07329853 BIT 61, No. 1, 337-359 (2021). MSC: 15A06 15B52 65F10 65F20 65Y20 68Q25 68W10 68W20 68W40 PDF BibTeX XML Cite \textit{J. D. Moorman} et al., BIT 61, No. 1, 337--359 (2021; Zbl 07329853) Full Text: DOI
Gutin, Gregory; Majumdar, Diptapriyo; Ordyniak, Sebastian; Wahlström, Magnus Parameterized pre-coloring extension and list coloring problems. (English) Zbl 07329533 SIAM J. Discrete Math. 35, No. 1, 575-596 (2021). MSC: 68Q27 05C85 68R10 68W05 05C15 PDF BibTeX XML Cite \textit{G. Gutin} et al., SIAM J. Discrete Math. 35, No. 1, 575--596 (2021; Zbl 07329533) Full Text: DOI
Dvořák, Pavel; Feldmann, Andreas E.; Knop, Dušan; Masařík, Tomáš; Toufar, Tomáš; Veselý, Pavel Parameterized approximation schemes for Steiner trees with small number of Steiner vertices. (English) Zbl 07329532 SIAM J. Discrete Math. 35, No. 1, 546-574 (2021). MSC: 68W25 05C85 68Q25 PDF BibTeX XML Cite \textit{P. Dvořák} et al., SIAM J. Discrete Math. 35, No. 1, 546--574 (2021; Zbl 07329532) Full Text: DOI
Languasco, Alessandro Numerical verification of Littlewood’s bounds for \(|L(1,\chi)|\). (English) Zbl 07329220 J. Number Theory 223, 12-34 (2021). MSC: 11M20 33-04 11Y16 11Y99 33B15 PDF BibTeX XML Cite \textit{A. Languasco}, J. Number Theory 223, 12--34 (2021; Zbl 07329220) Full Text: DOI
Bujtás, Csilla; Iršič, Vesna; Klavžar, Sandi Perfect graphs for domination games. (English) Zbl 07328908 Ann. Comb. 25, No. 1, 133-152 (2021). MSC: 05C57 05C69 05C17 91A43 68Q25 PDF BibTeX XML Cite \textit{C. Bujtás} et al., Ann. Comb. 25, No. 1, 133--152 (2021; Zbl 07328908) Full Text: DOI
Ghanbarian, N.; Tanhayi, M. Reza ‘Mutual complexity’ in hyperscaling violating background. (English) Zbl 07328566 Int. J. Mod. Phys. D 30, No. 2, Article ID 2150013, 15 p. (2021). MSC: 81T35 PDF BibTeX XML Cite \textit{N. Ghanbarian} and \textit{M. R. Tanhayi}, Int. J. Mod. Phys. D 30, No. 2, Article ID 2150013, 15 p. (2021; Zbl 07328566) Full Text: DOI
Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Simultaneous feedback edge set: a parameterized perspective. (English) Zbl 07328491 Algorithmica 83, No. 2, 753-774 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{A. Agrawal} et al., Algorithmica 83, No. 2, 753--774 (2021; Zbl 07328491) Full Text: DOI
Ganian, Robert; Ordyniak, Sebastian The power of cut-based parameters for computing edge-disjoint paths. (English) Zbl 07328490 Algorithmica 83, No. 2, 726-752 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{R. Ganian} and \textit{S. Ordyniak}, Algorithmica 83, No. 2, 726--752 (2021; Zbl 07328490) Full Text: DOI
Bilò, Vittorio; Mavronicolas, Marios The complexity of computational problems about Nash equilibria in symmetric win-lose games. (English) Zbl 07328481 Algorithmica 83, No. 2, 447-530 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{V. Bilò} and \textit{M. Mavronicolas}, Algorithmica 83, No. 2, 447--530 (2021; Zbl 07328481) Full Text: DOI
Cheng, Wanyou; Dai, Yu-Hong An active set Newton-CG method for \(\ell_1\) optimization. (English) Zbl 07328400 Appl. Comput. Harmon. Anal. 50, 303-325 (2021). MSC: 90C06 90C25 65Y20 94A08 PDF BibTeX XML Cite \textit{W. Cheng} and \textit{Y.-H. Dai}, Appl. Comput. Harmon. Anal. 50, 303--325 (2021; Zbl 07328400) Full Text: DOI
Pedersen, Geir K. Asymptotic, convergent, and exact truncating series solutions of the linear shallow water equations for channels with power law geometry. (English) Zbl 07328076 SIAM J. Appl. Math. 81, No. 2, 285-303 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{G. K. Pedersen}, SIAM J. Appl. Math. 81, No. 2, 285--303 (2021; Zbl 07328076) Full Text: DOI
Wang, Bin; Shen, Jun; Zhang, Shutao; Zhang, Zhizheng On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs. (English) Zbl 07327937 Log. Methods Comput. Sci. 17, No. 1, Paper No. 4, 46 p. (2021). MSC: 03B70 68 PDF BibTeX XML Cite \textit{B. Wang} et al., Log. Methods Comput. Sci. 17, No. 1, Paper No. 4, 46 p. (2021; Zbl 07327937) Full Text: Link arXiv
Müller, Moritz Typical forcings, NP search problems and an extension of a theorem of Riis. (English) Zbl 07327744 Ann. Pure Appl. Logic 172, No. 4, Article ID 102930, 44 p. (2021). MSC: 03E75 03C25 03H99 03F20 03D15 68Q17 PDF BibTeX XML Cite \textit{M. Müller}, Ann. Pure Appl. Logic 172, No. 4, Article ID 102930, 44 p. (2021; Zbl 07327744) Full Text: DOI
Barbato, Michele; Bezzi, Dario Monopolar graphs: complexity of computing classical graph parameters. (English) Zbl 07327718 Discrete Appl. Math. 291, 277-285 (2021). MSC: 68Q 68R PDF BibTeX XML Cite \textit{M. Barbato} and \textit{D. Bezzi}, Discrete Appl. Math. 291, 277--285 (2021; Zbl 07327718) Full Text: DOI
Alves, Jesmmer; Castonguay, Diane; Brüstle, Thomas Unit form recognition by mutations: application of mutations in the search of positive roots. (English) Zbl 07327713 Discrete Appl. Math. 291, 223-236 (2021). MSC: 05C22 05C85 05E10 05E16 68Q17 16G20 11E99 PDF BibTeX XML Cite \textit{J. Alves} et al., Discrete Appl. Math. 291, 223--236 (2021; Zbl 07327713) Full Text: DOI
Tsur, Dekel An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover. (English) Zbl 07327696 Discrete Appl. Math. 291, 1-14 (2021). MSC: 68R PDF BibTeX XML Cite \textit{D. Tsur}, Discrete Appl. Math. 291, 1--14 (2021; Zbl 07327696) Full Text: DOI
Dinur, Irit; Harsha, Prahladh; Kaufman, Tali; Navon, Inbal Livni; Ta-Shma, Amnon List-decoding with double samplers. (English) Zbl 07327268 SIAM J. Comput. 50, No. 2, 301-349 (2021). MSC: 68Q25 94B35 05C48 PDF BibTeX XML Cite \textit{I. Dinur} et al., SIAM J. Comput. 50, No. 2, 301--349 (2021; Zbl 07327268) Full Text: DOI
Dütting, P.; Roughgarden, T.; Talgam-Cohen, I. The complexity of contracts. (English) Zbl 07327266 SIAM J. Comput. 50, No. 1, 211-254 (2021). MSC: 68W40 91B40 PDF BibTeX XML Cite \textit{P. Dütting} et al., SIAM J. Comput. 50, No. 1, 211--254 (2021; Zbl 07327266) Full Text: DOI
Chattopadhyay, Arkadev; Filmus, Yuval; Koroth, Sajin; Meir, Or; Pitassi, Toniann Query-to-communication lifting using low-discrepancy gadgets. (English) Zbl 07327265 SIAM J. Comput. 50, No. 1, 171-210 (2021). MSC: 68Q17 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., SIAM J. Comput. 50, No. 1, 171--210 (2021; Zbl 07327265) Full Text: DOI
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
Chu, Van Tiep; Hoang, Viet Ha; Lim, Roktaek Sparse tensor product high dimensional finite elements for two-scale mixed problems. (English) Zbl 07327226 Comput. Math. Appl. 85, 42-56 (2021). MSC: 35 65 PDF BibTeX XML Cite \textit{V. T. Chu} et al., Comput. Math. Appl. 85, 42--56 (2021; Zbl 07327226) Full Text: DOI
Rojas, Cristobal; Yampolsky, Michael Real quadratic Julia sets can have arbitrarily high complexity. (English) Zbl 07326846 Found. Comput. Math. 21, No. 1, 59-69 (2021). MSC: 68Q17 37E05 PDF BibTeX XML Cite \textit{C. Rojas} and \textit{M. Yampolsky}, Found. Comput. Math. 21, No. 1, 59--69 (2021; Zbl 07326846) Full Text: DOI
van der Hoeven, Joris; Lecerf, Grégoire On the complexity exponent of polynomial system solving. (English) Zbl 07326845 Found. Comput. Math. 21, No. 1, 1-57 (2021). Reviewer: Vladimir P. Kostov (Nice) MSC: 14-04 14Q20 14B05 68W30 PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, Found. Comput. Math. 21, No. 1, 1--57 (2021; Zbl 07326845) Full Text: DOI
Lu, Yunfan; Zheng, Zhiyong A summary: quantifying the complexity of financial markets using composite and multivariate multiscale entropy. (English) Zbl 07326597 Zheng, Zhiyong (ed.), Proceedings of the first international forum on financial mathematics and financial technology, Suzhou, China, June 29 – July 2, 2019. Singapore: Springer (ISBN 978-981-15-8372-8/hbk; 978-981-15-8373-5/ebook). Financial Mathematics and Fintech, 139-155 (2021). MSC: 91G15 94A17 PDF BibTeX XML Cite \textit{Y. Lu} and \textit{Z. Zheng}, in: Proceedings of the first international forum on financial mathematics and financial technology, Suzhou, China, June 29 -- July 2, 2019. Singapore: Springer. 139--155 (2021; Zbl 07326597) Full Text: DOI
Mann, Ryan L.; Helmuth, Tyler Efficient algorithms for approximating quantum partition functions. (English) Zbl 07326357 J. Math. Phys. 62, No. 2, 022201, 7 p. (2021). MSC: 81P68 68Q12 81R25 81R25 41A65 PDF BibTeX XML Cite \textit{R. L. Mann} and \textit{T. Helmuth}, J. Math. Phys. 62, No. 2, 022201, 7 p. (2021; Zbl 07326357) Full Text: DOI
Liotta, Giuseppe; Montecchiani, Fabrizio; Tappini, Alessandra Ortho-polygon visibility representations of 3-connected 1-plane graphs. (English) Zbl 07325907 Theor. Comput. Sci. 863, 40-52 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{G. Liotta} et al., Theor. Comput. Sci. 863, 40--52 (2021; Zbl 07325907) Full Text: DOI
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
Alpert, Hannah; Roldán, Érika Art gallery problem with rook and queen vision. (English) Zbl 07324342 Graphs Comb. 37, No. 2, 621-642 (2021). MSC: 03D15 05B40 05B50 00A08 PDF BibTeX XML Cite \textit{H. Alpert} and \textit{É. Roldán}, Graphs Comb. 37, No. 2, 621--642 (2021; Zbl 07324342) Full Text: DOI
Ganesh, Chaya; Patra, Arpita Optimal extension protocols for Byzantine broadcast and agreement. (English) Zbl 07321643 Distrib. Comput. 34, No. 1, 59-77 (2021). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{C. Ganesh} and \textit{A. Patra}, Distrib. Comput. 34, No. 1, 59--77 (2021; Zbl 07321643) Full Text: DOI
Duchi, John C.; Ruan, Feng Asymptotic optimality in stochastic optimization. (English) Zbl 07319855 Ann. Stat. 49, No. 1, 21-48 (2021). Reviewer: Krzysztof Piasecki (Poznań) MSC: 62C20 62F10 62F12 62L20 68Q25 PDF BibTeX XML Cite \textit{J. C. Duchi} and \textit{F. Ruan}, Ann. Stat. 49, No. 1, 21--48 (2021; Zbl 07319855) Full Text: DOI Euclid
Tsur, Dekel Faster parameterized algorithm for Bicluster Editing. (English) Zbl 07319598 Inf. Process. Lett. 168, Article ID 106095, 8 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Tsur}, Inf. Process. Lett. 168, Article ID 106095, 8 p. (2021; Zbl 07319598) Full Text: DOI
Beyersdorff, Olaf; Blinkhorn, Joshua A simple proof of QBF hardness. (English) Zbl 07319596 Inf. Process. Lett. 168, Article ID 106093, 6 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{O. Beyersdorff} and \textit{J. Blinkhorn}, Inf. Process. Lett. 168, Article ID 106093, 6 p. (2021; Zbl 07319596) Full Text: DOI
Kiyomi, Masashi; Horiyama, Takashi; Otachi, Yota Longest common subsequence in sublinear space. (English) Zbl 07319593 Inf. Process. Lett. 168, Article ID 106084, 5 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{M. Kiyomi} et al., Inf. Process. Lett. 168, Article ID 106084, 5 p. (2021; Zbl 07319593) Full Text: DOI
Tsur, Dekel Kernel for \(K_t\)-free Edge Deletion. (English) Zbl 07319591 Inf. Process. Lett. 167, Article ID 106082, 5 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Tsur}, Inf. Process. Lett. 167, Article ID 106082, 5 p. (2021; Zbl 07319591) Full Text: DOI
Tsur, Dekel Algorithms for deletion problems on split graphs. (English) Zbl 07319584 Inf. Process. Lett. 167, Article ID 106066, 4 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Tsur}, Inf. Process. Lett. 167, Article ID 106066, 4 p. (2021; Zbl 07319584) Full Text: DOI
Aggarwal, Divesh; Chung, Eldon A note on the concrete hardness of the shortest independent vector in lattices. (English) Zbl 07319583 Inf. Process. Lett. 167, Article ID 106065, 6 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Aggarwal} and \textit{E. Chung}, Inf. Process. Lett. 167, Article ID 106065, 6 p. (2021; Zbl 07319583) Full Text: DOI
Gąsieniec, Leszek; Jansson, Jesper; Levcopoulos, Christos; Lingas, Andrzej; Persson, Mia Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases. (English) Zbl 07319298 J. Comput. Syst. Sci. 118, 108-118 (2021). MSC: 68 PDF BibTeX XML Cite \textit{L. Gąsieniec} et al., J. Comput. Syst. Sci. 118, 108--118 (2021; Zbl 07319298) Full Text: DOI
Kozachinskiy, Alexander; Shen, Alexander Automatic Kolmogorov complexity, normality, and finite-state dimension revisited. (English) Zbl 07319297 J. Comput. Syst. Sci. 118, 75-107 (2021). MSC: 68 PDF BibTeX XML Cite \textit{A. Kozachinskiy} and \textit{A. Shen}, J. Comput. Syst. Sci. 118, 75--107 (2021; Zbl 07319297) Full Text: DOI
Björklund, Henrik; Drewes, Frank; Ericson, Petter; Starke, Florian Uniform parsing for hyperedge replacement grammars. (English) Zbl 07319294 J. Comput. Syst. Sci. 118, 1-27 (2021). MSC: 68 PDF BibTeX XML Cite \textit{H. Björklund} et al., J. Comput. Syst. Sci. 118, 1--27 (2021; Zbl 07319294) Full Text: DOI
Rodomanov, Anton; Nesterov, Yurii Greedy quasi-Newton methods with explicit superlinear convergence. (English) Zbl 07319283 SIAM J. Optim. 31, No. 1, 785-811 (2021). MSC: 90C53 90C30 68Q25 PDF BibTeX XML Cite \textit{A. Rodomanov} and \textit{Y. Nesterov}, SIAM J. Optim. 31, No. 1, 785--811 (2021; Zbl 07319283) Full Text: DOI
Curtis, Frank E.; Robinson, Daniel P.; Royer, Clément W.; Wright, Stephen J. Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization. (English) Zbl 07319273 SIAM J. Optim. 31, No. 1, 518-544 (2021). MSC: 90C26 49M05 49M15 65K05 90C60 PDF BibTeX XML Cite \textit{F. E. Curtis} et al., SIAM J. Optim. 31, No. 1, 518--544 (2021; Zbl 07319273) Full Text: DOI
Adams, Terrence Genericity and rigidity for slow entropy transformations. (English) Zbl 07319064 New York J. Math. 27, 393-416 (2021). MSC: 37A05 37A25 37A35 PDF BibTeX XML Cite \textit{T. Adams}, New York J. Math. 27, 393--416 (2021; Zbl 07319064) Full Text: Link
Davis, Donald M.; Recio-Mitter, David The geodesic complexity of \(n\)-dimensional Klein bottles. (English) Zbl 07319059 New York J. Math. 27, 296-318 (2021). MSC: 53C22 55M30 68T40 PDF BibTeX XML Cite \textit{D. M. Davis} and \textit{D. Recio-Mitter}, New York J. Math. 27, 296--318 (2021; Zbl 07319059) Full Text: Link
Orellana-Martín, David; Valencia-Cabrera, Luis; Pérez-Jiménez, Mario J. Proof techniques in membrane computing. (English) Zbl 07318721 Theor. Comput. Sci. 862, 236-249 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Orellana-Martín} et al., Theor. Comput. Sci. 862, 236--249 (2021; Zbl 07318721) Full Text: DOI
Han, Yo-Sub; Ko, Sang-Ki; Ng, Timothy; Salomaa, Kai Closest substring problems for regular languages. (English) Zbl 07318714 Theor. Comput. Sci. 862, 144-154 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{Y.-S. Han} et al., Theor. Comput. Sci. 862, 144--154 (2021; Zbl 07318714) Full Text: DOI
Böckenhauer, Hans-Joachim; Hromkovič, Juraj; Krug, Sacha; Unger, Walter On the advice complexity of the online dominating set problem. (English) Zbl 07318710 Theor. Comput. Sci. 862, 81-96 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{H.-J. Böckenhauer} et al., Theor. Comput. Sci. 862, 81--96 (2021; Zbl 07318710) Full Text: DOI
Bîlbîe, Florin-Daniel; Păun, Andrei Small SNQ P systems with multiple types of spikes. (English) Zbl 07318706 Theor. Comput. Sci. 862, 14-23 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{F.-D. Bîlbîe} and \textit{A. Păun}, Theor. Comput. Sci. 862, 14--23 (2021; Zbl 07318706) Full Text: DOI
Georgiou, Chryssis; Mavronicolas, Marios; Monien, Burkhard The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values. (English) Zbl 07318689 Theor. Comput. Sci. 860, 84-97 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{C. Georgiou} et al., Theor. Comput. Sci. 860, 84--97 (2021; Zbl 07318689) Full Text: DOI
Calderoni, Luca; Margara, Luciano; Marzolla, Moreno Direct product primality testing of graphs is GI-hard. (English) Zbl 07318688 Theor. Comput. Sci. 860, 72-83 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{L. Calderoni} et al., Theor. Comput. Sci. 860, 72--83 (2021; Zbl 07318688) Full Text: DOI
Wu, Yan; Zhu, Jingming The relationship between asymptotic decomposition properties. (English) Zbl 07318675 Topology Appl. 292, Article ID 107623, 9 p. (2021). MSC: 54F45 PDF BibTeX XML Cite \textit{Y. Wu} and \textit{J. Zhu}, Topology Appl. 292, Article ID 107623, 9 p. (2021; Zbl 07318675) Full Text: DOI
Tsatsomeros, Michael J.; Zhang, Yueqiao Faith The fibre of P-matrices: the recursive construction of all matrices with positive principal minors. (English) Zbl 07318403 Linear Multilinear Algebra 69, No. 2, 224-232 (2021). 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 07318403) Full Text: DOI
Guo, Yongfeng; Wang, Linjie; Dong, Qiang; Lou, Xiaojuan Dynamical complexity of FitzHugh-Nagumo neuron model driven by Lévy noise and Gaussian white noise. (English) Zbl 07318228 Math. Comput. Simul. 181, 430-443 (2021). MSC: 82B PDF BibTeX XML Cite \textit{Y. Guo} et al., Math. Comput. Simul. 181, 430--443 (2021; Zbl 07318228) Full Text: DOI
Wang, Shufan; Tang, Haopeng; Ma, Zhihui Hopf bifurcation of a multiple-delayed predator-prey system with habitat complexity. (English) Zbl 07318182 Math. Comput. Simul. 180, 1-23 (2021). MSC: 37N 92D 34K PDF BibTeX XML Cite \textit{S. Wang} et al., Math. Comput. Simul. 180, 1--23 (2021; Zbl 07318182) Full Text: DOI
Chernov, Alexey; Hoel, Håkon; Law, Kody J. H.; Nobile, Fabio; Tempone, Raul Multilevel ensemble Kalman filtering for spatio-temporal processes. (English) Zbl 07317375 Numer. Math. 147, No. 1, 71-125 (2021). MSC: 65C30 65Y20 PDF BibTeX XML Cite \textit{A. Chernov} et al., Numer. Math. 147, No. 1, 71--125 (2021; Zbl 07317375) Full Text: DOI
Gondard-Cozette, Danielle Number of connected components of a real variety and \(\mathbb{R}\)-places. (Nombre de composantes connexes d’une variete reelle et \(\mathbb{R}\)-places.) (French. English summary) Zbl 07317145 J. Pure Appl. Algebra 225, No. 7, Article ID 106611, 13 p. (2021). MSC: 12D15 14P25 12J10 14Q20 PDF BibTeX XML Cite \textit{D. Gondard-Cozette}, J. Pure Appl. Algebra 225, No. 7, Article ID 106611, 13 p. (2021; Zbl 07317145) Full Text: DOI
Xie, Yue; Wright, Stephen J. Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints. (English) Zbl 07316869 J. Sci. Comput. 86, No. 3, Paper No. 38, 31 p. (2021). MSC: 68Q25 90C06 90C26 90C30 90C60 PDF BibTeX XML Cite \textit{Y. Xie} and \textit{S. J. Wright}, J. Sci. Comput. 86, No. 3, Paper No. 38, 31 p. (2021; Zbl 07316869) Full Text: DOI
Yang, Xi A geometric probability randomized Kaczmarz method for large scale linear systems. (English) Zbl 07316823 Appl. Numer. Math. 164, 139-160 (2021). MSC: 65F10 PDF BibTeX XML Cite \textit{X. Yang}, Appl. Numer. Math. 164, 139--160 (2021; Zbl 07316823) Full Text: DOI
Doerr, Benjamin; Mayer, Sebastian The recovery of ridge functions on the hypercube suffers from the curse of dimensionality. (English) Zbl 07316089 J. Complexity 63, Article ID 101521, 30 p. (2021). MSC: 65D15 65Y20 41A30 68W20 PDF BibTeX XML Cite \textit{B. Doerr} and \textit{S. Mayer}, J. Complexity 63, Article ID 101521, 30 p. (2021; Zbl 07316089) Full Text: DOI
van der Hoeven, Joris; Lecerf, Grégoire Fast computation of generic bivariate resultants. (English) Zbl 07316078 J. Complexity 62, Article ID 101499, 12 p. (2021). MSC: 13P10 68W30 11Y PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, J. Complexity 62, Article ID 101499, 12 p. (2021; Zbl 07316078) Full Text: DOI
Zakablukov, Dmitry V. On the dependence of the complexity and depth of reversible circuits consisting of not, CNOT, and 2-CNOT gates on the number of additional inputs. (English. Russian original) Zbl 07316013 Discrete Math. Appl. 31, No. 1, 61-75 (2021); translation from Diskretn. Mat. 32, No. 1, 8-26 (2020). MSC: 94C 68 PDF BibTeX XML Cite \textit{D. V. Zakablukov}, Discrete Math. Appl. 31, No. 1, 61--75 (2021; Zbl 07316013); translation from Diskretn. Mat. 32, No. 1, 8--26 (2020) Full Text: DOI
Cherepnev, Mikhail A. Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem. (English. Russian original) Zbl 07316008 Discrete Math. Appl. 31, No. 1, 1-4 (2021); translation from Diskretn. Mat. 32, No. 1, 110-114 (2020). MSC: 11 13 PDF BibTeX XML Cite \textit{M. A. Cherepnev}, Discrete Math. Appl. 31, No. 1, 1--4 (2021; Zbl 07316008); translation from Diskretn. Mat. 32, No. 1, 110--114 (2020) Full Text: DOI
Malyshev, D. S.; Razvenskaya, O. O.; Pardalos, P. M. The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs. (English) Zbl 07315894 Optim. Lett. 15, No. 1, 137-152 (2021). MSC: 05C PDF BibTeX XML Cite \textit{D. S. Malyshev} et al., Optim. Lett. 15, No. 1, 137--152 (2021; Zbl 07315894) Full Text: DOI
Cenedese, Carlo; Belgioioso, Giuseppe; Grammatico, Sergio; Cao, Ming An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games. (English) Zbl 07315786 Eur. J. Control 58, 143-151 (2021). MSC: 91A11 91A10 91A68 PDF BibTeX XML Cite \textit{C. Cenedese} et al., Eur. J. Control 58, 143--151 (2021; Zbl 07315786) Full Text: DOI
O’Neill, Michael; Wright, Stephen J. A log-barrier Newton-CG method for bound constrained optimization with complexity guarantees. (English) Zbl 07315147 IMA J. Numer. Anal. 41, No. 1, 84-121 (2021). MSC: 65 PDF BibTeX XML Cite \textit{M. O'Neill} and \textit{S. J. Wright}, IMA J. Numer. Anal. 41, No. 1, 84--121 (2021; Zbl 07315147) Full Text: DOI
Pavlov, Ronnie; Vanier, Pascal The relationship between word complexity and computational complexity in subshifts. (English) Zbl 07314925 Discrete Contin. Dyn. Syst. 41, No. 4, 1627-1648 (2021). MSC: 37B10 03D15 03D40 08A50 PDF BibTeX XML Cite \textit{R. Pavlov} and \textit{P. Vanier}, Discrete Contin. Dyn. Syst. 41, No. 4, 1627--1648 (2021; Zbl 07314925) Full Text: DOI
Etessami, Kousha The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game. (English) Zbl 07314601 Games Econ. Behav. 125, 107-140 (2021). MSC: 91A18 91A11 91A06 91A68 68Q17 PDF BibTeX XML Cite \textit{K. Etessami}, Games Econ. Behav. 125, 107--140 (2021; Zbl 07314601) Full Text: DOI
Chen, Pengwen; Cheng, Chung-Kuan; Wang, Xinyuan Arnoldi algorithms with structured orthogonalization. (English) Zbl 07314375 SIAM J. Numer. Anal. 59, No. 1, 370-400 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{P. Chen} et al., SIAM J. Numer. Anal. 59, No. 1, 370--400 (2021; Zbl 07314375) Full Text: DOI