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
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
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
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). Reviewer: Francisco Marcellán (Leganes) MSC: 15B57 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
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
Aldi, Marco; de Beaudrap, Niel; Gharibian, Sevag; Saeedi, Seyran On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 07303874 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 07303874) Full Text: DOI
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
Brattka, Vasco; Gherardi, Guido Completion of choice. (English) Zbl 07300475 Ann. Pure Appl. Logic 172, No. 3, Article ID 102914, 31 p. (2021). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D30 03D78 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 07300475) Full Text: DOI
Durand, Arnaud; Haak, Anselm; Kontinen, Juha; Vollmer, Heribert Descriptive complexity of \(\#\text{P}\) functions: a new perspective. (English) Zbl 07300315 J. Comput. Syst. Sci. 116, 40-54 (2021). MSC: 68Q19 PDF BibTeX XML Cite \textit{A. Durand} et al., J. Comput. Syst. Sci. 116, 40--54 (2021; Zbl 07300315) Full Text: DOI
Bodirsky, Manuel; Mottet, Antoine; Olšák, Miroslav; Opršal, Jakub; Pinsker, Michael; Willard, Ross \( \omega \)-categorical structures avoiding height 1 identities. (English) Zbl 07288857 Trans. Am. Math. Soc. 374, No. 1, 327-350 (2021). 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 07288857) Full Text: DOI
Georgiev, Ivan; Kristiansen, Lars; Stephan, Frank Computable irrational numbers with representations of surprising complexity. (English) Zbl 07285679 Ann. Pure Appl. Logic 172, No. 2, Article ID 102893, 30 p. (2021). 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 07285679) Full Text: DOI
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
Cicerone, Serafino; Di Stefano, Gabriele; Navarra, Alfredo Gathering robots in graphs: the central role of synchronicity. (English) Zbl 07285598 Theor. Comput. Sci. 849, 99-120 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{S. Cicerone} et al., Theor. Comput. Sci. 849, 99--120 (2021; Zbl 07285598) Full Text: DOI
Zang, Yaohua; Bao, Gang; Ye, Xiaojing; Zha, Hongyuan; Zhou, Haomin A jump stochastic differential equation approach for influence prediction on heterogenous networks. (English) Zbl 07342293 Commun. Math. Sci. 18, No. 8, 2341-2359 (2020). MSC: 65Y10 90B18 94A20 PDF BibTeX XML Cite \textit{Y. Zang} et al., Commun. Math. Sci. 18, No. 8, 2341--2359 (2020; Zbl 07342293) Full Text: DOI
Shchesnovich, V. S. On the classical complexity of sampling from quantum interference of indistinguishable bosons. (English) Zbl 07336392 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 07336392) Full Text: DOI
Dvir, Zeev; Liu, Allen Fourier and circulant matrices are not rigid. (English) Zbl 07330816 Theory Comput. 16, Paper No. 20, 48 p. (2020). MSC: 68Q17 68Q15 PDF BibTeX XML Cite \textit{Z. Dvir} and \textit{A. Liu}, Theory Comput. 16, Paper No. 20, 48 p. (2020; Zbl 07330816) Full Text: DOI
Loomis, Samuel P.; Mahoney, John R.; Aghamohammadi, Cina; Crutchfield, James P. Optimizing quantum models of classical channels: the reverse Holevo problem. (English) Zbl 07327987 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 07327987) Full Text: DOI
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
Norman, Matthew; Larkin, Jeffrey A holistic algorithmic approach to improving accuracy, robustness, and computational efficiency for atmospheric dynamics. (English) Zbl 07301552 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 07301552) Full Text: DOI
Garg, Ankit; Göös, Mika; Kamath, Pritish; Sokolov, Dmitry Monotone circuit lower bounds from resolution. (English) Zbl 07286923 Theory Comput. 16, Paper No. 13, 30 p. (2020). MSC: 68Q17 68Q15 03F20 PDF BibTeX XML Cite \textit{A. Garg} et al., Theory Comput. 16, Paper No. 13, 30 p. (2020; Zbl 07286923) Full Text: DOI
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
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
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
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: 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
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
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
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
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
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
Bun, Mark; Thaler, Justin A nearly optimal lower bound on the approximate degree of \(AC^0\). (English) Zbl 07239247 SIAM J. Comput. 49, No. 4, FOCS17-59-FOCS17-96 (2020). MSC: 03D15 68Q12 68Q15 68Q17 PDF BibTeX XML Cite \textit{M. Bun} and \textit{J. Thaler}, SIAM J. Comput. 49, No. 4, FOCS17--59-FOCS17--96 (2020; Zbl 07239247) Full Text: DOI
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
Basu, Saugata; Isik, Umut Categorical complexity. (English) Zbl 1452.18001 Forum Math. Sigma 8, Paper No. 34, 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. 34, 63 p. (2020; Zbl 1452.18001) Full Text: DOI
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
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
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
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
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
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
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
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
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
Laurent, Olivier Polynomial time in untyped elementary linear logic. (English) Zbl 07191311 Theor. Comput. Sci. 813, 117-142 (2020). MSC: 03F52 68Q15 PDF BibTeX XML Cite \textit{O. Laurent}, Theor. Comput. Sci. 813, 117--142 (2020; Zbl 07191311) Full Text: DOI
Baillot, Patrick; Ghyselen, Alexis Combining linear logic and size types for implicit complexity. (English) Zbl 1433.68086 Theor. Comput. Sci. 813, 70-99 (2020). MSC: 68N18 03B70 03F52 68Q15 PDF BibTeX XML Cite \textit{P. Baillot} and \textit{A. Ghyselen}, Theor. Comput. Sci. 813, 70--99 (2020; Zbl 1433.68086) Full Text: DOI
Duparc, Jacques; Vuilleumier, Louis The Wadge order on the Scott domain is not a well-quasi-order. (English) Zbl 07190476 J. Symb. Log. 85, No. 1, 300-324 (2020). MSC: 03B70 03D30 03E15 54H05 68Q15 PDF BibTeX XML Cite \textit{J. Duparc} and \textit{L. Vuilleumier}, J. Symb. Log. 85, No. 1, 300--324 (2020; Zbl 07190476) Full Text: DOI
Habib, Michel; Mouatadid, Lalla Maximum induced matching algorithms via vertex ordering characterizations. (English) Zbl 1433.68296 Algorithmica 82, No. 2, 260-278 (2020). MSC: 68R10 05C70 05C76 05C85 68Q25 68W40 PDF BibTeX XML Cite \textit{M. Habib} and \textit{L. Mouatadid}, Algorithmica 82, No. 2, 260--278 (2020; Zbl 1433.68296) Full Text: DOI
Di Rocco, Sandra; Eklund, David; Weinstein, Madeleine The bottleneck degree of algebraic varieties. (English) Zbl 07187724 SIAM J. Appl. Algebra Geom. 4, No. 1, 227-253 (2020). MSC: 14Q20 62-07 68Q32 65D18 PDF BibTeX XML Cite \textit{S. Di Rocco} et al., SIAM J. Appl. Algebra Geom. 4, No. 1, 227--253 (2020; Zbl 07187724) Full Text: DOI
Barto, Libor; Pinsker, Michael Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). (English) Zbl 1432.68169 SIAM J. Comput. 49, No. 2, 365-393 (2020). MSC: 68Q25 03C05 03C35 08A70 68Q17 68Q27 68R07 PDF BibTeX XML Cite \textit{L. Barto} and \textit{M. Pinsker}, SIAM J. Comput. 49, No. 2, 365--393 (2020; Zbl 1432.68169) Full Text: DOI
Moser, Philippe Polylog depth, highness and lowness for E. (English) Zbl 1441.68112 Inf. Comput. 271, Article ID 104483, 10 p. (2020). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q30 03D15 68Q15 PDF BibTeX XML Cite \textit{P. Moser}, Inf. Comput. 271, Article ID 104483, 10 p. (2020; Zbl 1441.68112) Full Text: DOI
Grüttemeier, Niels; Komusiewicz, Christian On the relation of strong triadic closure and cluster deletion. (English) Zbl 1435.68235 Algorithmica 82, No. 4, 853-880 (2020). MSC: 68R10 05C85 68Q25 68Q27 68W40 91D30 PDF BibTeX XML Cite \textit{N. Grüttemeier} and \textit{C. Komusiewicz}, Algorithmica 82, No. 4, 853--880 (2020; Zbl 1435.68235) Full Text: DOI
Lecomte, Dominique On the complexity of Borel equivalence relations with some countability property. (English) Zbl 07174539 Trans. Am. Math. Soc. 373, No. 3, 1845-1883 (2020). MSC: 03E15 28A05 54H05 PDF BibTeX XML Cite \textit{D. Lecomte}, Trans. Am. Math. Soc. 373, No. 3, 1845--1883 (2020; Zbl 07174539) Full Text: DOI
Koiran, Pascal; Skomra, Mateusz Intersection multiplicity of a sparse curve and a low-degree curve. (English) Zbl 1436.14016 J. Pure Appl. Algebra 224, No. 7, Article ID 106279, 16 p. (2020). Reviewer: Gema Maria Diaz Toca (Murcia) MSC: 14C17 14H50 14Q20 PDF BibTeX XML Cite \textit{P. Koiran} and \textit{M. Skomra}, J. Pure Appl. Algebra 224, No. 7, Article ID 106279, 16 p. (2020; Zbl 1436.14016) Full Text: DOI
Arenas, Marcelo; Muñoz, Martin; Riveros, Cristian Descriptive complexity for counting complexity classes. (English) Zbl 1442.68061 Log. Methods Comput. Sci. 16, No. 1, Paper No. 9, 42 p. (2020). MSC: 68Q15 03B70 03D15 68Q19 PDF BibTeX XML Cite \textit{M. Arenas} et al., Log. Methods Comput. Sci. 16, No. 1, Paper No. 9, 42 p. (2020; Zbl 1442.68061) Full Text: arXiv
Berkholz, Christoph; Nordström, Jakob Supercritical space-width trade-offs for resolution. (English) Zbl 07166152 SIAM J. Comput. 49, No. 1, 98-118 (2020). MSC: 03B70 03D15 03F20 68Q15 68Q17 68V15 PDF BibTeX XML Cite \textit{C. Berkholz} and \textit{J. Nordström}, SIAM J. Comput. 49, No. 1, 98--118 (2020; Zbl 07166152) Full Text: DOI
Dose, Titus An oracle separating conjectures about incompleteness in the finite domain. (English) Zbl 1436.68124 Theor. Comput. Sci. 809, 466-481 (2020). MSC: 68Q15 03D15 03F20 PDF BibTeX XML Cite \textit{T. Dose}, Theor. Comput. Sci. 809, 466--481 (2020; Zbl 1436.68124) Full Text: DOI
Neumann, Eike; Steinberg, Florian Parametrised second-order complexity theory with applications to the study of interval computation. (English) Zbl 1454.03057 Theor. Comput. Sci. 806, 281-304 (2020). MSC: 03D78 03D65 68Q15 PDF BibTeX XML Cite \textit{E. Neumann} and \textit{F. Steinberg}, Theor. Comput. Sci. 806, 281--304 (2020; Zbl 1454.03057) Full Text: DOI
Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne Mim-width. II. The feedback vertex set problem. (English) Zbl 1442.05158 Algorithmica 82, No. 1, 118-145 (2020). MSC: 05C69 05C70 05C12 68Q27 PDF BibTeX XML Cite \textit{L. Jaffke} et al., Algorithmica 82, No. 1, 118--145 (2020; Zbl 1442.05158) Full Text: DOI
Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio Subroutines in P systems and closure properties of their complexity classes. (English) Zbl 1436.68116 Theor. Comput. Sci. 805, 193-205 (2020). MSC: 68Q07 68Q15 PDF BibTeX XML Cite \textit{A. Leporati} et al., Theor. Comput. Sci. 805, 193--205 (2020; Zbl 1436.68116) Full Text: DOI
Hromkovič, Juraj; Rossmanith, Peter What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\). (English) Zbl 1436.68126 J. Comput. Syst. Sci. 107, 142-155 (2020). MSC: 68Q15 PDF BibTeX XML Cite \textit{J. Hromkovič} and \textit{P. Rossmanith}, J. Comput. Syst. Sci. 107, 142--155 (2020; Zbl 1436.68126) Full Text: DOI
Beloshapka, Valery K. On integration of functions of complexity one. (English) Zbl 07325527 J. Sib. Fed. Univ., Math. Phys. 12, No. 4, 496-502 (2019). MSC: 68 03 PDF BibTeX XML Cite \textit{V. K. Beloshapka}, J. Sib. Fed. Univ., Math. Phys. 12, No. 4, 496--502 (2019; Zbl 07325527) Full Text: DOI MNR
Sellier, Jean Michel; Caron, Gaétan Marceau; Leygonie, Jacob Signed particles and neural networks, towards efficient simulations of quantum systems. (English) Zbl 1456.81018 J. Comput. Phys. 387, 154-162 (2019). MSC: 81P05 81-10 68T05 68T07 81S30 65Y10 65Y20 65Z05 PDF BibTeX XML Cite \textit{J. M. Sellier} et al., J. Comput. Phys. 387, 154--162 (2019; Zbl 1456.81018) Full Text: DOI
Dean, Walter Computational complexity theory and the philosophy of mathematics. (English) Zbl 1451.68128 Philos. Math. (3) 27, No. 3, 381-439 (2019); erratum ibid. 28, No. 2, 290 (2020). MSC: 68Q15 00A30 PDF BibTeX XML Cite \textit{W. Dean}, Philos. Math. (3) 27, No. 3, 381--439 (2019; Zbl 1451.68128) Full Text: DOI
Hollender, Alexandros The classes PPA-\(k\): existence from arguments modulo \(k\). (English) Zbl 1435.68107 Caragiannis, Ioannis (ed.) et al., Web and Internet economics. 15th international conference, WINE 2019, New York, NY, USA, December 10–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11920, 214-227 (2019). MSC: 68Q15 68Q25 91B32 PDF BibTeX XML Cite \textit{A. Hollender}, Lect. Notes Comput. Sci. 11920, 214--227 (2019; Zbl 1435.68107) Full Text: DOI
Amendola, Giovanni; Ricca, Francesco; Truszczynski, Miroslaw Beyond NP: quantifying over answer sets. (English) Zbl 1434.68068 Theory Pract. Log. Program. 19, No. 5-6, 705-721 (2019). MSC: 68N17 68Q15 PDF BibTeX XML Cite \textit{G. Amendola} et al., Theory Pract. Log. Program. 19, No. 5--6, 705--721 (2019; Zbl 1434.68068) Full Text: DOI
Naor, Moni; Paneth, Omer; Rothblum, Guy N. Incrementally verifiable computation via incremental PCPs. (English) Zbl 1452.68079 Hofheinz, Dennis (ed.) et al., Theory of cryptography. 17th international conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 11892, 552-576 (2019). MSC: 68Q10 68Q15 94A60 PDF BibTeX XML Cite \textit{M. Naor} et al., Lect. Notes Comput. Sci. 11892, 552--576 (2019; Zbl 1452.68079) Full Text: DOI
Kuperberg, Greg Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization. (English) Zbl 1434.57013 Pac. J. Math. 301, No. 1, 189-241 (2019). Reviewer: Bruno Zimmermann (Trieste) MSC: 57K30 57M50 68Q15 PDF BibTeX XML Cite \textit{G. Kuperberg}, Pac. J. Math. 301, No. 1, 189--241 (2019; Zbl 1434.57013) Full Text: DOI
Agrawal, Manindra; Ghosh, Sumanta; Saxena, Nitin Bootstrapping variables in algebraic circuits. (English) Zbl 1433.68151 Proc. Natl. Acad. Sci. USA 116, No. 17, 8107-8118 (2019). MSC: 68Q15 68Q17 68W20 PDF BibTeX XML Cite \textit{M. Agrawal} et al., Proc. Natl. Acad. Sci. USA 116, No. 17, 8107--8118 (2019; Zbl 1433.68151) Full Text: DOI
Sosík, Petr P systems attacking hard problems beyond NP: a survey. (English) Zbl 1431.68035 J. Membr. Comput. 1, No. 3, 198-208 (2019). MSC: 68Q07 68Q15 68Q17 PDF BibTeX XML Cite \textit{P. Sosík}, J. Membr. Comput. 1, No. 3, 198--208 (2019; Zbl 1431.68035) Full Text: DOI
Leporati, Alberto; Manzoni, Luca; Mauri, Giancarlo; Porreca, Antonio E.; Zandron, Claudio Characterizing PSPACE with shallow non-confluent P systems. (English) Zbl 1431.68030 J. Membr. Comput. 1, No. 2, 75-84 (2019). MSC: 68Q07 68Q15 PDF BibTeX XML Cite \textit{A. Leporati} et al., J. Membr. Comput. 1, No. 2, 75--84 (2019; Zbl 1431.68030) Full Text: DOI
Rossman, Ben; Srinivasan, Srikanth Separation of \(\mathsf{AC}^0[\oplus]\) formulas and circuits. (English) Zbl 07166711 Theory Comput. 15, Paper No. 17, 20 p. (2019). MSC: 68Q17 68Q15 PDF BibTeX XML Cite \textit{B. Rossman} and \textit{S. Srinivasan}, Theory Comput. 15, Paper No. 17, 20 p. (2019; Zbl 07166711) Full Text: DOI
McKay, Dylan M.; Murray, Cody D.; Williams, R. Ryan Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. (English) Zbl 1434.68160 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215-1225 (2019). MSC: 68Q06 68P30 68Q15 68Q17 68Q30 68W27 PDF BibTeX XML Cite \textit{D. M. McKay} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 1215--1225 (2019; Zbl 1434.68160) Full Text: DOI
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 1433.68140 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 442-453 (2019). MSC: 68Q06 68Q15 PDF BibTeX XML Cite \textit{N. Limaye} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 442--453 (2019; Zbl 1433.68140) Full Text: DOI
Yehudayoff, Amir Separating monotone VP and VNP. (English) Zbl 1433.68154 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 425-429 (2019). MSC: 68Q15 PDF BibTeX XML Cite \textit{A. Yehudayoff}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 425--429 (2019; Zbl 1433.68154) Full Text: DOI
Sherstov, Alexander A.; Wu, Pei Near-optimal lower bounds on the threshold degree and sign-rank of \(\mathrm{AC}^0\). (English) Zbl 1433.68153 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 401-412 (2019). MSC: 68Q15 68Q06 68Q11 68Q17 PDF BibTeX XML Cite \textit{A. A. Sherstov} and \textit{P. Wu}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 401--412 (2019; Zbl 1433.68153) Full Text: DOI
Raz, Ran; Tal, Avishay Oracle separation of BQP and PH. (English) Zbl 1433.68152 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 13-23 (2019). MSC: 68Q15 68Q06 68Q12 PDF BibTeX XML Cite \textit{R. Raz} and \textit{A. Tal}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 13--23 (2019; Zbl 1433.68152) Full Text: DOI
de Haan, Ronald Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy. (English) Zbl 1435.68010 Lecture Notes in Computer Science 11880. Berlin: Springer (ISBN 978-3-662-60669-8/pbk; 978-3-662-60670-4/ebook). xi, 398 p. (2019). MSC: 68-02 03B44 68Q15 68Q27 68Q60 68T20 68T30 PDF BibTeX XML Cite \textit{R. de Haan}, Parameterized complexity in the polynomial hierarchy. Extending parameterized complexity theory to higher levels of the hierarchy. Berlin: Springer (2019; Zbl 1435.68010) Full Text: DOI
Vidick, Thomas From operator algebras to complexity theory and back. (English) Zbl 1444.46048 Notices Am. Math. Soc. 66, No. 10, 1618-1627 (2019). MSC: 46L60 46N50 68Q15 17B69 81P68 81R15 PDF BibTeX XML Cite \textit{T. Vidick}, Notices Am. Math. Soc. 66, No. 10, 1618--1627 (2019; Zbl 1444.46048) Full Text: DOI
Kayal, Neeraj; Nair, Vineet; Saha, Chandan Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. (English) Zbl 07145988 Comput. Complexity 28, No. 4, 749-828 (2019). MSC: 68Q05 68Q15 68Q17 68Q32 PDF BibTeX XML Cite \textit{N. Kayal} et al., Comput. Complexity 28, No. 4, 749--828 (2019; Zbl 07145988) Full Text: DOI
Goldreich, Oded Hierarchy theorems for testing properties in size-oblivious query complexity. (English) Zbl 07145987 Comput. Complexity 28, No. 4, 709-747 (2019). MSC: 68Q15 68W20 PDF BibTeX XML Cite \textit{O. Goldreich}, Comput. Complexity 28, No. 4, 709--747 (2019; Zbl 07145987) Full Text: DOI
Meir, Or On derandomized composition of Boolean functions. (English) Zbl 07145986 Comput. Complexity 28, No. 4, 661-708 (2019). MSC: 68Q15 PDF BibTeX XML Cite \textit{O. Meir}, Comput. Complexity 28, No. 4, 661--708 (2019; Zbl 07145986) Full Text: DOI
Chattopadhyay, Arkadev; Koucký, Michal; Loff, Bruno; Mukhopadhyay, Sagnik Simulation theorems via pseudo-random properties. (English) Zbl 07145985 Comput. Complexity 28, No. 4, 617-659 (2019). MSC: 68Q15 68Q87 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., Comput. Complexity 28, No. 4, 617--659 (2019; Zbl 07145985) Full Text: DOI
Applebaum, Benny; Raykov, Pavel On the relationship between statistical zero-knowledge and statistical randomized encodings. (English) Zbl 1454.94042 Comput. Complexity 28, No. 4, 573-616 (2019). MSC: 94A60 68Q15 PDF BibTeX XML Cite \textit{B. Applebaum} and \textit{P. Raykov}, Comput. Complexity 28, No. 4, 573--616 (2019; Zbl 1454.94042) Full Text: DOI
Czarnetzki, Silke; Krebs, Andreas A topological approach to non-uniform complexity. (English) Zbl 1435.68106 Inf. Comput. 269, Article ID 104443, 24 p. (2019). MSC: 68Q15 68Q06 68Q70 PDF BibTeX XML Cite \textit{S. Czarnetzki} and \textit{A. Krebs}, Inf. Comput. 269, Article ID 104443, 24 p. (2019; Zbl 1435.68106) Full Text: DOI
Aydinlioğlu, Bariş; Bach, Eric Corrigendum to: “Affine relativization: unifying the algebrization and relativization barriers”. (English) Zbl 1427.68093 ACM Trans. Comput. Theory 11, No. 3, Article No. 16, 1 p. (2019). MSC: 68Q15 03B70 PDF BibTeX XML Cite \textit{B. Aydinlioğlu} and \textit{E. Bach}, ACM Trans. Comput. Theory 11, No. 3, Article No. 16, 1 p. (2019; Zbl 1427.68093) Full Text: DOI
Chou, Chi-Ning; Kumar, Mrinal; Solomon, Noam Closure results for polynomial factorization. (English) Zbl 07140490 Theory Comput. 15, Paper No. 13, 34 p. (2019). MSC: 68Q15 68Q17 PDF BibTeX XML Cite \textit{C.-N. Chou} et al., Theory Comput. 15, Paper No. 13, 34 p. (2019; Zbl 07140490) Full Text: DOI
Dvir, Zeev; Edelman, Benjamin L. Matrix rigidity and the Croot-Lev-Pach lemma. (English) Zbl 07140485 Theory Comput. 15, Paper No. 8, 7 p. (2019). MSC: 68Q17 68Q15 PDF BibTeX XML Cite \textit{Z. Dvir} and \textit{B. L. Edelman}, Theory Comput. 15, Paper No. 8, 7 p. (2019; Zbl 07140485) Full Text: DOI
Gesmundo, Fulvio; Landsberg, Joseph M. Explicit polynomial sequences with maximal spaces of partial derivatives and a question of K. Mulmuley. (English) Zbl 07140480 Theory Comput. 15, Paper No. 3, 24 p. (2019). MSC: 68Q15 15A69 PDF BibTeX XML Cite \textit{F. Gesmundo} and \textit{J. M. Landsberg}, Theory Comput. 15, Paper No. 3, 24 p. (2019; Zbl 07140480) Full Text: DOI
Modanese, Augusto Complexity-theoretic aspects of expanding cellular automata. (English) Zbl 1425.68284 Castillo-Ramirez, Alonso (ed.) et al., Cellular automata and discrete complex systems. 25th IFIP WG 1.5 international workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11525, 20-34 (2019). MSC: 68Q80 03D30 68Q15 PDF BibTeX XML Cite \textit{A. Modanese}, Lect. Notes Comput. Sci. 11525, 20--34 (2019; Zbl 1425.68284) Full Text: DOI
Abascal, Jackson; Hemaspaandra, Lane A.; Maimon, Shir; Rubery, Daniel Closure and nonclosure properties of the compressible and rankable sets. (English) Zbl 1425.03014 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 177-189 (2019). MSC: 03D15 03D20 68Q15 PDF BibTeX XML Cite \textit{J. Abascal} et al., Lect. Notes Comput. Sci. 11417, 177--189 (2019; Zbl 1425.03014) Full Text: DOI arXiv
Balko, L.; Lörinc, J. On the cup-length of certain classes of flag manifolds. (English) Zbl 1449.57006 Acta Math. Hung. 159, No. 2, 638-652 (2019). Reviewer: Bruno Zimmermann (Trieste) MSC: 57N65 55M30 57R20 PDF BibTeX XML Cite \textit{L. Balko} and \textit{J. Lörinc}, Acta Math. Hung. 159, No. 2, 638--652 (2019; Zbl 1449.57006) Full Text: DOI
Impagliazzo, Russell; Meka, Raghu; Zuckerman, David Pseudorandomness from shrinkage. (English) Zbl 1427.68096 J. ACM 66, No. 2, Article No. 11, 16 p. (2019). MSC: 68Q15 68Q17 68Q87 PDF BibTeX XML Cite \textit{R. Impagliazzo} et al., J. ACM 66, No. 2, Article No. 11, 16 p. (2019; Zbl 1427.68096) Full Text: DOI
Jaffke, Lars; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne Mim-width. III. Graph powers and generalized distance domination problems. (English) Zbl 1442.05157 Theor. Comput. Sci. 796, 216-236 (2019). MSC: 05C69 05C70 05C12 68Q27 PDF BibTeX XML Cite \textit{L. Jaffke} et al., Theor. Comput. Sci. 796, 216--236 (2019; Zbl 1442.05157) Full Text: DOI
Friedland, Shmuel; Lim, Lek-Heng; Zhang, Jinjie Grothendieck constant is norm of Strassen matrix multiplication tensor. (English) Zbl 1426.15033 Numer. Math. 143, No. 4, 905-922 (2019). MSC: 15A60 15A69 47A80 65Y20 68Q15 PDF BibTeX XML Cite \textit{S. Friedland} et al., Numer. Math. 143, No. 4, 905--922 (2019; Zbl 1426.15033) Full Text: DOI
Beckmann, Arnold; Buss, Sam; Friedman, Sy-David; Müller, Moritz; Thapen, Neil Feasible set functions have small circuits. (English) Zbl 07123522 Computability 8, No. 1, 67-98 (2019). MSC: 03D15 03D20 03D65 03E99 68Q15 PDF BibTeX XML Cite \textit{A. Beckmann} et al., Computability 8, No. 1, 67--98 (2019; Zbl 07123522) Full Text: DOI
Le, Hoang-Oanh; Le, Van Bang Hardness and structural results for half-squares of restricted tree convex bipartite graphs. (English) Zbl 1434.68365 Algorithmica 81, No. 11-12, 4258-4274 (2019). MSC: 68R10 05C75 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{H.-O. Le} and \textit{V. B. Le}, Algorithmica 81, No. 11--12, 4258--4274 (2019; Zbl 1434.68365) Full Text: DOI
Chen, Lijie; Goldwasser, Shafi; Lyu, Kaifeng; Rothblum, Guy N.; Rubinstein, Aviad Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\). (English) Zbl 1431.68045 Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1-20 (2019). MSC: 68Q25 68P05 68Q15 68W25 PDF BibTeX XML Cite \textit{L. Chen} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1--20 (2019; Zbl 1431.68045) Full Text: DOI
Diamantopoulos, Georgios; Hössinger, Andreas; Selberherr, Siegfried; Weinbub, Josef A shared memory parallel multi-mesh fast marching method for re-distancing. (English) Zbl 07116001 Adv. Comput. Math. 45, No. 4, 2029-2045 (2019). MSC: 65Y05 65Y10 65Y20 PDF BibTeX XML Cite \textit{G. Diamantopoulos} et al., Adv. Comput. Math. 45, No. 4, 2029--2045 (2019; Zbl 07116001) Full Text: DOI
Eiben, Eduard; Kumar, Mithilesh; Mouawad, Amer E.; Panolan, Fahad; Siebertz, Sebastian Lossy kernels for connected dominating set on sparse graphs. (English) Zbl 1430.68195 SIAM J. Discrete Math. 33, No. 3, 1743-1771 (2019). MSC: 68R10 05C69 68Q27 PDF BibTeX XML Cite \textit{E. Eiben} et al., SIAM J. Discrete Math. 33, No. 3, 1743--1771 (2019; Zbl 1430.68195) Full Text: DOI
Creignou, Nadia; Kröll, Markus; Pichler, Reinhard; Skritek, Sebastian; Vollmer, Heribert A complexity theory for hard enumeration problems. (English) Zbl 1419.05016 Discrete Appl. Math. 268, 191-209 (2019). MSC: 05A15 68Q17 PDF BibTeX XML Cite \textit{N. Creignou} et al., Discrete Appl. Math. 268, 191--209 (2019; Zbl 1419.05016) Full Text: DOI
Capelli, Florent; Strozecki, Yann Incremental delay enumeration: space and time. (English) Zbl 1419.05014 Discrete Appl. Math. 268, 179-190 (2019). MSC: 05A15 68Q15 68Q25 PDF BibTeX XML Cite \textit{F. Capelli} and \textit{Y. Strozecki}, Discrete Appl. Math. 268, 179--190 (2019; Zbl 1419.05014) Full Text: DOI
Haak, Anselm; Vollmer, Heribert A model-theoretic characterization of constant-depth arithmetic circuits. (English) Zbl 07106326 Ann. Pure Appl. Logic 170, No. 9, 1008-1029 (2019). MSC: 03C13 68Q05 68Q10 68Q15 68Q19 PDF BibTeX XML Cite \textit{A. Haak} and \textit{H. Vollmer}, Ann. Pure Appl. Logic 170, No. 9, 1008--1029 (2019; Zbl 07106326) Full Text: DOI