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: 65F PDF BibTeX XML Cite \textit{X. Yang}, Appl. Numer. Math. 164, 139--160 (2021; Zbl 07316823) 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: 90C PDF BibTeX XML Cite \textit{D. S. Malyshev} et al., Optim. Lett. 15, No. 1, 137--152 (2021; Zbl 07315894) 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 03D25 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
Skopenkov, Arkadiy A short exposition of Salman Parsa’s theorems on intrinsic linking and non-realizability. (English) Zbl 07308730 Discrete Comput. Geom. 65, No. 2, 584-585 (2021). MSC: 57K10 57M15 57Q35 05C10 52C45 68U05 52B05 PDF BibTeX XML Cite \textit{A. Skopenkov}, Discrete Comput. Geom. 65, No. 2, 584--585 (2021; Zbl 07308730) Full Text: DOI
Nuspl, Philipp Solving a fixed number of equations over finite groups. (English) Zbl 07308304 Algebra Univers. 82, No. 1, Paper No. 12, 13 p. (2021). MSC: 20F10 13P15 PDF BibTeX XML Cite \textit{P. Nuspl}, Algebra Univers. 82, No. 1, Paper No. 12, 13 p. (2021; Zbl 07308304) Full Text: DOI
Haah, Jeongwan; Hastings, Matthew B.; Kothari, Robin; Low, Guang Hao Quantum algorithm for simulating real time evolution of lattice Hamiltonians. (English) Zbl 07307637 SIAM J. Comput. 50, FOCS18-250-FOCS18-284 (2021). MSC: 81-08 81Q10 82D25 81P68 68W25 65Z05 11G55 81P65 68Q12 37M05 PDF BibTeX XML Cite \textit{J. Haah} et al., SIAM J. Comput. 50, FOCS18--250-FOCS18--284 (2021; Zbl 07307637) Full Text: DOI
Ailon, Nir; Yehuda, Gal The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform. (English) Zbl 07306053 Inf. Process. Lett. 165, Article ID 106024, 8 p. (2021). MSC: 68Q PDF BibTeX XML Cite \textit{N. Ailon} and \textit{G. Yehuda}, Inf. Process. Lett. 165, Article ID 106024, 8 p. (2021; Zbl 07306053) Full Text: DOI
Abreu, Alexandre; Cunha, Luís; de Figueiredo, Celina; Kowada, Luis; Marquezino, Franklin; Portugal, Renato; Posner, Daniel A computational complexity comparative study of graph tessellation problems. (English) Zbl 07305081 Theor. Comput. Sci. 858, 81-89 (2021). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{A. Abreu} et al., Theor. Comput. Sci. 858, 81--89 (2021; Zbl 07305081) Full Text: DOI
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 07305079 Theor. Comput. Sci. 858, 49-63 (2021). MSC: 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{N. Chiarelli} et al., Theor. Comput. Sci. 858, 49--63 (2021; Zbl 07305079) Full Text: DOI
Calandra, Henri; Gratton, Serge; Riccietti, Elisa; Vasseur, Xavier On high-order multilevel optimization strategies. (English) Zbl 07304306 SIAM J. Optim. 31, No. 1, 307-330 (2021). MSC: 90C30 65K05 90C26 90C60 PDF BibTeX XML Cite \textit{H. Calandra} et al., SIAM J. Optim. 31, No. 1, 307--330 (2021; Zbl 07304306) Full Text: DOI
Omoomi, Behnaz; Roshanbin, Elham; Dastjerdi, Marzieh Vahid A polynomial time algorithm to find the star chromatic index of trees. (English) Zbl 07303529 Electron. J. Comb. 28, No. 1, Research Paper P1.6, 16 p. (2021). Reviewer: Zhizhang Shen (Plymouth) MSC: 05C05 05C15 68Q17 PDF BibTeX XML Cite \textit{B. Omoomi} et al., Electron. J. Comb. 28, No. 1, Research Paper P1.6, 16 p. (2021; Zbl 07303529) Full Text: DOI
Koivusalo, Henna; Walton, James J. Cut and project sets with polytopal window I: complexity. (English) Zbl 07301405 Ergodic Theory Dyn. Syst. 41, No. 5, 1431-1463 (2021). MSC: 68U05 52C23 52C45 PDF BibTeX XML Cite \textit{H. Koivusalo} and \textit{J. J. Walton}, Ergodic Theory Dyn. Syst. 41, No. 5, 1431--1463 (2021; Zbl 07301405) Full Text: DOI
Dudko, Artem; Yampolsky, Michael On computational complexity of Cremer Julia sets. (English) Zbl 07301059 Fundam. Math. 252, No. 3, 343-353 (2021). MSC: 37F10 37F50 68Q17 PDF BibTeX XML Cite \textit{A. Dudko} and \textit{M. Yampolsky}, Fundam. Math. 252, No. 3, 343--353 (2021; Zbl 07301059) Full Text: DOI
Carmon, Yair; Duchi, John C.; Hinder, Oliver; Sidford, Aaron Lower bounds for finding stationary points II: first-order methods. (English) Zbl 07300742 Math. Program. 185, No. 1-2 (A), 315-355 (2021). MSC: 90C26 90C30 90C60 90C06 68Q25 PDF BibTeX XML Cite \textit{Y. Carmon} et al., Math. Program. 185, No. 1--2 (A), 315--355 (2021; Zbl 07300742) Full Text: DOI
Ouyang, Yuyuan; Xu, Yangyang Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. (English) Zbl 07300733 Math. Program. 185, No. 1-2 (A), 1-35 (2021). MSC: 90C25 90C06 90C60 49M37 68Q25 PDF BibTeX XML Cite \textit{Y. Ouyang} and \textit{Y. Xu}, Math. Program. 185, No. 1--2 (A), 1--35 (2021; Zbl 07300733) Full Text: DOI
Boscain, Ugo; Pozzoli, Eugenio; Sigalotti, Mario Classical and quantum controllability of a rotating symmetric molecule. (English) Zbl 07299442 SIAM J. Control Optim. 59, No. 1, 156-184 (2021). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{U. Boscain} et al., SIAM J. Control Optim. 59, No. 1, 156--184 (2021; Zbl 07299442) Full Text: DOI
Wu, Huishan Ring structure theorems and arithmetic comprehension. (English) Zbl 07297803 Arch. Math. Logic 60, No. 1-2, 145-160 (2021). MSC: 03B30 03D15 PDF BibTeX XML Cite \textit{H. Wu}, Arch. Math. Logic 60, No. 1--2, 145--160 (2021; Zbl 07297803) Full Text: DOI
Schrock, Tyler; Frongillo, Rafael Computational complexity of \(k\)-block conjugacy. (English) Zbl 07297776 Theor. Comput. Sci. 856, 21-40 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{T. Schrock} and \textit{R. Frongillo}, Theor. Comput. Sci. 856, 21--40 (2021; Zbl 07297776) Full Text: DOI
Javadi, Ramin; Ashkboos, Saleh Multi-way sparsest cut problem on trees with a control on the number of parts and outliers. (English) Zbl 07289389 Discrete Appl. Math. 289, 281-291 (2021). MSC: 68 05 PDF BibTeX XML Cite \textit{R. Javadi} and \textit{S. Ashkboos}, Discrete Appl. Math. 289, 281--291 (2021; Zbl 07289389) 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
Li, Wei; Ovchinnikov, Alexey; Pogudin, Gleb; Scanlon, Thomas Elimination of unknowns for systems of algebraic differential-difference equations. (English) Zbl 07288856 Trans. Am. Math. Soc. 374, No. 1, 303-326 (2021). Reviewer: Franz Winkler (Linz) MSC: 12H05 12H10 03C10 14Q20 PDF BibTeX XML Cite \textit{W. Li} et al., Trans. Am. Math. Soc. 374, No. 1, 303--326 (2021; Zbl 07288856) 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
Bärtschi, Andreas; Bampas, Evangelos; Chalopin, Jérémie; Das, Shantanu; Karousatou, Christina; Mihalák, Matúš Near-gathering of energy-constrained mobile agents. (English) Zbl 07285595 Theor. Comput. Sci. 849, 35-46 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{A. Bärtschi} et al., Theor. Comput. Sci. 849, 35--46 (2021; Zbl 07285595) Full Text: DOI
Yang, Yaguang Arc-search techniques for interior-point methods. (English) Zbl 1448.90002 Boca Raton, FL: CRC Press (ISBN 978-0-367-48728-7/hbk; 978-1-003-04251-8/ebook). 316 p. (2021). MSC: 90-01 90C51 90C05 90C20 90C22 90C60 PDF BibTeX XML Cite \textit{Y. Yang}, Arc-search techniques for interior-point methods. Boca Raton, FL: CRC Press (2021; Zbl 1448.90002) Full Text: DOI
Tovey, Craig A. Linear programming with duals. A modern exposition. (English) Zbl 06267632 Boca Raton, FL: CRC Press (ISBN 978-1-4398-8746-2/hbk). 480 p. (2021). MSC: 90-02 90C05 90C10 90C60 90-04 PDF BibTeX XML Cite \textit{C. A. Tovey}, Linear programming with duals. A modern exposition. Boca Raton, FL: CRC Press (2021; Zbl 06267632)
Panin, Artem A.; Plyasunov, Alexander V. Stability analysis for pricing. (English) Zbl 07315672 Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer (ISBN 978-3-030-58656-0/pbk; 978-3-030-58657-7/ebook). Communications in Computer and Information Science 1275, 57-69 (2020). MSC: 91B24 91A65 91A80 68Q17 PDF BibTeX XML Cite \textit{A. A. Panin} and \textit{A. V. Plyasunov}, Commun. Comput. Inf. Sci. 1275, 57--69 (2020; Zbl 07315672) Full Text: DOI
Novoselov, S. A. Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\). (English) Zbl 07312733 Finite Fields Appl. 68, Article ID 101757, 27 p. (2020). MSC: 11Y16 14H45 14Q05 11G20 11T06 PDF BibTeX XML Cite \textit{S. A. Novoselov}, Finite Fields Appl. 68, Article ID 101757, 27 p. (2020; Zbl 07312733) Full Text: DOI
Tsitsiashvili, G. Sh. The computational complexity of optimal blocking of vertices in the digraph. (Russian. English summary) Zbl 07311865 Dal’nevost. Mat. Zh. 20, No. 2, 267-270 (2020). MSC: 68R10 PDF BibTeX XML Cite \textit{G. Sh. Tsitsiashvili}, Dal'nevost. Mat. Zh. 20, No. 2, 267--270 (2020; Zbl 07311865) Full Text: DOI MNR
Chen, Zhihao; Zhang, Zhao; Ran, Yingli; Shi, Yishuo; Du, Ding-Zhu Data mule scheduling on a path with handling time and time span constraints. (English) Zbl 07311783 Optim. Lett. 14, No. 7, 1701-1710 (2020). MSC: 90C PDF BibTeX XML Cite \textit{Z. Chen} et al., Optim. Lett. 14, No. 7, 1701--1710 (2020; Zbl 07311783) Full Text: DOI
Ahmed, Suhaib; Naz, Syed Farah Design of quantum dot cellular automata based fault tolerant convolution encoders for secure nanocomputing. (English) Zbl 07309073 Int. J. Quantum Inf. 18, No. 6, Article ID 2050032, 22 p. (2020). MSC: 81P68 81Q37 82D80 68Q80 68Q06 81P70 68M10 68M15 PDF BibTeX XML Cite \textit{S. Ahmed} and \textit{S. F. Naz}, Int. J. Quantum Inf. 18, No. 6, Article ID 2050032, 22 p. (2020; Zbl 07309073) Full Text: DOI
Mittelmann, Hans D. Benchmarking optimization software – a (Hi)story. (English) Zbl 1453.90003 SN Oper. Res. Forum 1, No. 1, Paper No. 2, 7 p. (2020). MSC: 90-03 90-04 01A61 90C60 PDF BibTeX XML Cite \textit{H. D. Mittelmann}, SN Oper. Res. Forum 1, No. 1, Paper No. 2, 7 p. (2020; Zbl 1453.90003) Full Text: DOI
Gäfvert, Oliver Computational complexity of learning algebraic varieties. (English) Zbl 07304608 Adv. Appl. Math. 121, Article ID 102100, 26 p. (2020). MSC: 13P25 14Q20 62J02 PDF BibTeX XML Cite \textit{O. Gäfvert}, Adv. Appl. Math. 121, Article ID 102100, 26 p. (2020; Zbl 07304608) Full Text: DOI
Li, Feng; Xu, Zhou; Chen, Zhi-Long Production and transportation integration for commit-to-delivery mode with general shipping costs. (English) Zbl 07303820 INFORMS J. Comput. 32, No. 4, 1012-1029 (2020). MSC: 90B06 90C59 PDF BibTeX XML Cite \textit{F. Li} et al., INFORMS J. Comput. 32, No. 4, 1012--1029 (2020; Zbl 07303820) Full Text: DOI
Erickson, Jeff; Wang, Yipu Topologically trivial closed walks in directed surface graphs. (English) Zbl 07303724 Discrete Comput. Geom. 64, No. 4, 1253-1294 (2020). MSC: 68Q 68R 90B 68Q25 90B06 68R10 68Q45 PDF BibTeX XML Cite \textit{J. Erickson} and \textit{Y. Wang}, Discrete Comput. Geom. 64, No. 4, 1253--1294 (2020; Zbl 07303724) Full Text: DOI
Chan, Timothy M. Dynamic geometric data structures via shallow cuttings. (English) Zbl 07303723 Discrete Comput. Geom. 64, No. 4, 1235-1252 (2020). MSC: 68Q25 68U05 68P05 PDF BibTeX XML Cite \textit{T. M. Chan}, Discrete Comput. Geom. 64, No. 4, 1235--1252 (2020; Zbl 07303723) Full Text: DOI
Eppstein, David Counting polygon triangulations is hard. (English) Zbl 07303722 Discrete Comput. Geom. 64, No. 4, 1210-1234 (2020). MSC: 52C45 68U05 68Q17 68U05 05C10 PDF BibTeX XML Cite \textit{D. Eppstein}, Discrete Comput. Geom. 64, No. 4, 1210--1234 (2020; Zbl 07303722) Full Text: DOI
Itsykson, Dmitry; Knop, Alexander; Romashchenko, Andrei; Sokolov, Dmitry On OBDD-based algorithms and proof systems that dynamically change the order of variables. (English) Zbl 07303637 J. Symb. Log. 85, No. 2, 632-670 (2020). MSC: 68Q11 68R07 05C48 94B05 PDF BibTeX XML Cite \textit{D. Itsykson} et al., J. Symb. Log. 85, No. 2, 632--670 (2020; Zbl 07303637) Full Text: DOI
Kazda, Alexandr; Valeriote, Matt Deciding some Maltsev conditions in finite idempotent algebras. (English) Zbl 07303632 J. Symb. Log. 85, No. 2, 539-562 (2020). MSC: 68Q25 03B05 08A40 PDF BibTeX XML Cite \textit{A. Kazda} and \textit{M. Valeriote}, J. Symb. Log. 85, No. 2, 539--562 (2020; Zbl 07303632) Full Text: DOI
Klockiewicz, Bazyli; Darve, Eric Sparse hierarchical preconditioners using piecewise smooth approximations of eigenvectors. (English) Zbl 07303432 SIAM J. Sci. Comput. 42, No. 6, A3907-A3931 (2020). MSC: 65F05 65F08 65F50 65Y20 PDF BibTeX XML Cite \textit{B. Klockiewicz} and \textit{E. Darve}, SIAM J. Sci. Comput. 42, No. 6, A3907--A3931 (2020; Zbl 07303432) Full Text: DOI
Calvetti, Daniela; Pragliola, Monica; Somersalo, Erkki Sparsity promoting hybrid solvers for hierarchical Bayesian inverse problems. (English) Zbl 07303422 SIAM J. Sci. Comput. 42, No. 6, A3761-A3784 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{D. Calvetti} et al., SIAM J. Sci. Comput. 42, No. 6, A3761--A3784 (2020; Zbl 07303422) Full Text: DOI
Gordeev, Lew; Haeusler, Edward Hermann Proof compression and NP versus PSPACE. II. (English) Zbl 07302940 Bull. Sect. Log., Univ. Łódź, Dep. Log. 49, No. 3, 213-230 (2020). MSC: 03 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 07302940) 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 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
Hainry, Emmanuel; Kapron, Bruce M.; Marion, Jean-Yves; Péchoux, Romain A tier-based typed programming language characterizing feasible functionals. (English) Zbl 07299494 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 535-549 (2020). MSC: 68 PDF BibTeX XML Cite \textit{E. Hainry} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 535--549 (2020; Zbl 07299494) Full Text: DOI
Fearnley, John; Ibsen-Jensen, Rasmus; Savani, Rahul One-clock priced timed games are PSPACE-hard. (English) Zbl 07299484 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 397-409 (2020). MSC: 68 PDF BibTeX XML Cite \textit{J. Fearnley} et al., in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 397--409 (2020; Zbl 07299484) Full Text: DOI
Blondin, Michael; Raskin, Mikhail The complexity of reachability in affine vector addition systems with states. (English) Zbl 07299471 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 224-236 (2020). MSC: 68 PDF BibTeX XML Cite \textit{M. Blondin} and \textit{M. Raskin}, in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 224--236 (2020; Zbl 07299471) Full Text: DOI
Zhuk, Dmitriy; Martin, Barnaby QCSP monsters and the demise of the Chen conjecture. (English) Zbl 07298233 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 91-104 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Zhuk} and \textit{B. Martin}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 91--104 (2020; Zbl 07298233) Full Text: DOI
Campercholi, Miguel; Tellechea, Mauricio; Ventura, Pablo Deciding quantifier-free definability in finite algebraic structures. (English) Zbl 07297790 Felty, Amy (ed.) et al., 14th international workshop on logical and semantic frameworks, with applications, LSFA 2019, Natal, Brazil, in August 2019. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 348, 23-41 (2020). MSC: 03B70 68Q17 PDF BibTeX XML Cite \textit{M. Campercholi} et al., Electron. Notes Theor. Comput. Sci. 348, 23--41 (2020; Zbl 07297790) Full Text: DOI
Bentz, Cédric; Costa, Marie-Christine; Hertz, Alain On the edge capacitated Steiner tree problem. (English) Zbl 07297232 Discrete Optim. 38, Article ID 100607, 25 p. (2020). MSC: 90C PDF BibTeX XML Cite \textit{C. Bentz} et al., Discrete Optim. 38, Article ID 100607, 25 p. (2020; Zbl 07297232) Full Text: DOI
He, Cheng; Han, Xinxin Two-agent scheduling to minimize makespan and total completion time on a serial-batching machine. (English) Zbl 07295047 Chin. J. Eng. Math. 37, No. 4, 487-494 (2020). MSC: 90B35 90C29 PDF BibTeX XML Cite \textit{C. He} and \textit{X. Han}, Chin. J. Eng. Math. 37, No. 4, 487--494 (2020; Zbl 07295047) Full Text: DOI
Lushchakova, I. N. Geometric algorithms for finding a point in the intersection of balls. (English. Russian original) Zbl 07294456 Autom. Remote Control 81, No. 5, 869-882 (2020); translation from Avtom. Telemekh. 2020, No. 5, 139-155 (2020). Reviewer: Frank Plastria (Brussels) MSC: 65D18 51M04 51N20 68Q25 68U05 PDF BibTeX XML Cite \textit{I. N. Lushchakova}, Autom. Remote Control 81, No. 5, 869--882 (2020; Zbl 07294456); translation from Avtom. Telemekh. 2020, No. 5, 139--155 (2020) Full Text: DOI
Klassen, Joel; Marvian, Milad; Piddock, Stephen; Ioannou, Marios; Hen, Itay; Terhal, Barbara M. Hardness and ease of curing the sign problem for two-local qubit Hamiltonians. (English) Zbl 07294224 SIAM J. Comput. 49, No. 6, 1332-1362 (2020). Reviewer: Do Ngoc Diep (Hanoi) MSC: 81P68 68Q12 65C05 15A66 81Q10 PDF BibTeX XML Cite \textit{J. Klassen} et al., SIAM J. Comput. 49, No. 6, 1332--1362 (2020; Zbl 07294224) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 07294223 SIAM J. Comput. 49, No. 6, 1291-1331 (2020). MSC: 68U05 68W05 68Q25 05C10 05C69 PDF BibTeX XML Cite \textit{M. de Berg} et al., SIAM J. Comput. 49, No. 6, 1291--1331 (2020; Zbl 07294223) Full Text: DOI
Aronov, Boris; Bar-On, Gali; Katz, Matthew J. Resolving SINR queries in a dynamic setting. (English) Zbl 07294222 SIAM J. Comput. 49, No. 6, 1271-1290 (2020). MSC: 68Q25 68U05 68W25 68W20 PDF BibTeX XML Cite \textit{B. Aronov} et al., SIAM J. Comput. 49, No. 6, 1271--1290 (2020; Zbl 07294222) Full Text: DOI
Qu, Qing; Li, Xiao; Zhu, Zhihui Exact recovery of multichannel sparse blind deconvolution via gradient descent. (English) Zbl 07292237 SIAM J. Imaging Sci. 13, No. 3, 1630-1652 (2020). MSC: 65K05 65Y20 65D18 68U10 94A12 PDF BibTeX XML Cite \textit{Q. Qu} et al., SIAM J. Imaging Sci. 13, No. 3, 1630--1652 (2020; Zbl 07292237) Full Text: DOI
Daskalakis, Emmanouil; Herrmann, Felix J.; Kuske, Rachel Accelerating sparse recovery by reducing chatter. (English) Zbl 07292223 SIAM J. Imaging Sci. 13, No. 3, 1211-1239 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{E. Daskalakis} et al., SIAM J. Imaging Sci. 13, No. 3, 1211--1239 (2020; Zbl 07292223) Full Text: DOI
Kolpakov, Roman M.; Posypkin, Mikhail A. Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method. (English. Russian original) Zbl 07291226 Discrete Math. Appl. 30, No. 5, 313-325 (2020); translation from Diskretn. Mat. 31, No. 4, 20-37 (2019). MSC: 90C27 90C57 PDF BibTeX XML Cite \textit{R. M. Kolpakov} and \textit{M. A. Posypkin}, Discrete Math. Appl. 30, No. 5, 313--325 (2020; Zbl 07291226); translation from Diskretn. Mat. 31, No. 4, 20--37 (2019) Full Text: DOI
Schewe, Lars; Schmidt, Martin; Thürauf, Johannes Computing technical capacities in the European entry-exit gas market is NP-hard. (English) Zbl 1451.90032 Ann. Oper. Res. 295, No. 1, 337-362 (2020). MSC: 90B10 90C35 90C60 90C90 PDF BibTeX XML Cite \textit{L. Schewe} et al., Ann. Oper. Res. 295, No. 1, 337--362 (2020; Zbl 1451.90032) Full Text: DOI
Pilipczuk, Marcin; Sorge, Manuel A double exponential lower bound for the distinct vectors problem. (English) Zbl 07290424 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 9, 4 p. (2020). MSC: 68P10 PDF BibTeX XML Cite \textit{M. Pilipczuk} and \textit{M. Sorge}, Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 9, 4 p. (2020; Zbl 07290424) Full Text: Link
Kolman, Petr; Koutecký, Martin; Tiwary, Hans Raj Extension complexity, MSO logic, and treewidth. (English) Zbl 07290423 Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 8, 25 p. (2020). MSC: 68U05 03B70 68Q27 68R10 PDF BibTeX XML Cite \textit{P. Kolman} et al., Discrete Math. Theor. Comput. Sci. 22, No. 4, Paper No. 8, 25 p. (2020; Zbl 07290423) Full Text: Link
Hainry, Emmanuel; Péchoux, Romain Theory of higher order interpretations and application to basic feasible functions. (English) Zbl 07288619 Log. Methods Comput. Sci. 16, No. 4, Paper No. 14, 25 p. (2020). MSC: 03B70 68 PDF BibTeX XML Cite \textit{E. Hainry} and \textit{R. Péchoux}, Log. Methods Comput. Sci. 16, No. 4, Paper No. 14, 25 p. (2020; Zbl 07288619) Full Text: Link arXiv
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
Aaronson, Scott; Gunn, Sam On the classical hardness of spoofing linear cross-entropy benchmarking. (English) Zbl 07286921 Theory Comput. 16, Paper No. 11, 8 p. (2020). MSC: 81P68 68Q17 68Q12 94A20 PDF BibTeX XML Cite \textit{S. Aaronson} and \textit{S. Gunn}, Theory Comput. 16, Paper No. 11, 8 p. (2020; Zbl 07286921) Full Text: DOI
Bun, Mark; Kothari, Robin; Thaler, Justin The polynomial method strikes back: tight quantum query bounds via dual polynomials. (English) Zbl 07286920 Theory Comput. 16, Paper No. 10, 71 p. (2020). MSC: 68Q17 81P68 PDF BibTeX XML Cite \textit{M. Bun} et al., Theory Comput. 16, Paper No. 10, 71 p. (2020; Zbl 07286920) Full Text: DOI
Hrubeš, Pavel On the complexity of computing a random Boolean function over the reals. (English) Zbl 07286919 Theory Comput. 16, Paper No. 9, 12 p. (2020). MSC: 68Q17 03C10 PDF BibTeX XML Cite \textit{P. Hrubeš}, Theory Comput. 16, Paper No. 9, 12 p. (2020; Zbl 07286919) Full Text: DOI
Haitner, Iftach; Holenstein, Thomas; Reingold, Omer; Vadhan, Salil; Wee, Hoeteck Inaccessible entropy. II: IE functions and universal one-way hashing. (English) Zbl 07286918 Theory Comput. 16, Paper No. 8, 55 p. (2020). MSC: 94A17 94A60 PDF BibTeX XML Cite \textit{I. Haitner} et al., Theory Comput. 16, Paper No. 8, 55 p. (2020; Zbl 07286918) Full Text: DOI
Chen, Lijie On the hardness of approximate and exact (bichromatic) maximum inner product. (English) Zbl 07286914 Theory Comput. 16, Paper No. 4, 50 p. (2020). MSC: 68Q17 PDF BibTeX XML Cite \textit{L. Chen}, Theory Comput. 16, Paper No. 4, 50 p. (2020; Zbl 07286914) Full Text: DOI
Yeung, Yu-Hong; Pothen, Alex; Crouch, Jessica AMPS: Real-time mesh cutting with augmented matrices for surgical simulations. (English) Zbl 07286033 Numer. Linear Algebra Appl. 27, No. 6, e2323, 19 p. (2020). MSC: 65F50 65F10 65F05 65Y20 PDF BibTeX XML Cite \textit{Y.-H. Yeung} et al., Numer. Linear Algebra Appl. 27, No. 6, e2323, 19 p. (2020; Zbl 07286033) Full Text: DOI
de Campos, Cassio P.; Stamoulis, Georgios; Weyland, Dennis A structured view on weighted counting with relations to counting, quantum computation and applications. (English) Zbl 07285768 Inf. Comput. 275, Article ID 104627, 25 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{C. P. de Campos} et al., Inf. Comput. 275, Article ID 104627, 25 p. (2020; Zbl 07285768) Full Text: DOI
Hladík, Milan An overview of polynomially computable characteristics of special interval matrices. (English) Zbl 07285515 Kosheleva, Olga (ed.) et al., Beyond traditional probabilistic data processing techniques: interval, fuzzy etc. methods and their applications. Dedicated to Vladik Kreinovich on the occasion of his 65th birthday. Cham: Springer (ISBN 978-3-030-31040-0/hbk; 978-3-030-31041-7/ebook). Studies in Computational Intelligence 835, 295-310 (2020). MSC: 68T37 PDF BibTeX XML Cite \textit{M. Hladík}, Stud. Comput. Intell. 835, 295--310 (2020; Zbl 07285515) Full Text: DOI
Choi, Byung-Cheon; Park, Myoung-Ju Scheduling two projects with controllable processing times in a single-machine environment. (English) Zbl 07284385 J. Sched. 23, No. 5, 619-628 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{B.-C. Choi} and \textit{M.-J. Park}, J. Sched. 23, No. 5, 619--628 (2020; Zbl 07284385) Full Text: DOI
Amalladinne, Vamsi K.; Chamberland, Jean-Francois; Narayanan, Krishna R. A coded compressed sensing scheme for unsourced multiple access. (English) Zbl 1452.94010 IEEE Trans. Inf. Theory 66, No. 10, 6509-6533 (2020). MSC: 94A12 94A05 PDF BibTeX XML Cite \textit{V. K. Amalladinne} et al., IEEE Trans. Inf. Theory 66, No. 10, 6509--6533 (2020; Zbl 1452.94010) Full Text: DOI
Sherstov, Alexander A. Algorithmic polynomials. (English) Zbl 07282218 SIAM J. Comput. 49, No. 6, 1173-1231 (2020). MSC: 68Q17 81P68 PDF BibTeX XML Cite \textit{A. A. Sherstov}, SIAM J. Comput. 49, No. 6, 1173--1231 (2020; Zbl 07282218) 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
Hopp, Alexander Vincent The complexity of Zadeh’s pivot rule. (English) Zbl 1448.90003 Berlin: Logos Verlag; Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.) (ISBN 978-3-8325-5206-0). xvi, 319 p., open access (2020). MSC: 90-02 90C60 90C05 PDF BibTeX XML Cite \textit{A. V. Hopp}, The complexity of Zadeh's pivot rule. Berlin: Logos Verlag; Darmstadt: TU Darmstadt, Fachbereich Mathematik (Diss.) (2020; Zbl 1448.90003) Full Text: DOI Link
Burr, Michael; Wolf, Christian Computability at zero temperature. (English) Zbl 07278305 Nonlinearity 33, No. 11, 6157-6175 (2020). Reviewer: Hasan Akin (Gaziantep) MSC: 37D35 37E45 03D15 37B10 37L40 03D80 PDF BibTeX XML Cite \textit{M. Burr} and \textit{C. Wolf}, Nonlinearity 33, No. 11, 6157--6175 (2020; Zbl 07278305) Full Text: DOI
Sasamal, Trailokya Nath; Singh, Ashutosh Kumar; Mohan, Anand Quantum-dot cellular automata based digital logic circuits: a design perspective. (English) Zbl 1448.68013 Studies in Computational Intelligence 879. Singapore: Springer (ISBN 978-981-15-1822-5/hbk; 978-981-15-1823-2/ebook). xiv, 178 p. (2020). MSC: 68-01 68Q06 68Q07 68Q09 68Q80 81P68 81Q37 PDF BibTeX XML Cite \textit{T. N. Sasamal} et al., Quantum-dot cellular automata based digital logic circuits: a design perspective. Singapore: Springer (2020; Zbl 1448.68013) Full Text: DOI
Pulina, Luca (ed.); Seidl, Martina (ed.) Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. (English) Zbl 07277672 Lecture Notes in Computer Science 12178. Cham: Springer (ISBN 978-3-030-51824-0/pbk; 978-3-030-51825-7/ebook). xi, 538 p. (2020). MSC: 68-06 68Q25 68R07 68T20 00B25 PDF BibTeX XML Cite \textit{L. Pulina} (ed.) and \textit{M. Seidl} (ed.), Theory and applications of satisfiability testing -- SAT 2020. 23rd international conference, Alghero, Italy, July 3--10, 2020. Proceedings. Cham: Springer (2020; Zbl 07277672) Full Text: DOI
Gonçalves, Ricardo; Knorr, Matthias; Leite, João; Woltran, Stefan On the limits of forgetting in answer set programming. (English) Zbl 07274569 Artif. Intell. 286, Article ID 103307, 45 p. (2020). MSC: 68T PDF BibTeX XML Cite \textit{R. Gonçalves} et al., Artif. Intell. 286, Article ID 103307, 45 p. (2020; Zbl 07274569) Full Text: DOI
Pilatte, Cédric NP-completeness of slope-constrained drawing of complete graphs. (English) Zbl 07273667 J. Comput. Geom. 11, No. 1, 372-396 (2020). MSC: 68U05 PDF BibTeX XML Cite \textit{C. Pilatte}, J. Comput. Geom. 11, No. 1, 372--396 (2020; Zbl 07273667) Full Text: Link
Zhuk, Dmitriy A proof of the CSP dichotomy conjecture. (English) Zbl 07273097 J. ACM 67, No. 5, Article No. 30, 78 p. (2020). MSC: 68 PDF BibTeX XML Cite \textit{D. Zhuk}, J. ACM 67, No. 5, Article No. 30, 78 p. (2020; Zbl 07273097) Full Text: DOI
Dawar, Anuj; Vagnozzi, Danny Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization. (English) Zbl 1451.05248 Mosc. J. Comb. Number Theory 9, No. 3, 229-252 (2020). MSC: 05E16 05E30 05E99 68Q17 PDF BibTeX XML Cite \textit{A. Dawar} and \textit{D. Vagnozzi}, Mosc. J. Comb. Number Theory 9, No. 3, 229--252 (2020; Zbl 1451.05248) Full Text: DOI
Jin, Jinbi Computation of étale cohomology on curves in single exponential time. (English. French summary) Zbl 07272142 J. Théor. Nombres Bordx. 32, No. 2, 311-354 (2020). MSC: 14F20 14Q05 14Q20 PDF BibTeX XML Cite \textit{J. Jin}, J. Théor. Nombres Bordx. 32, No. 2, 311--354 (2020; Zbl 07272142) Full Text: DOI
Daneshmand, Amir; Scutari, Gesualdo; Kungurtsev, Vyacheslav Second-order guarantees of distributed gradient algorithms. (English) Zbl 07271854 SIAM J. Optim. 30, No. 4, 3029-3068 (2020). MSC: 68Q25 68R10 68U05 PDF BibTeX XML Cite \textit{A. Daneshmand} et al., SIAM J. Optim. 30, No. 4, 3029--3068 (2020; Zbl 07271854) Full Text: DOI
Jiang, Bo; Lin, Tianyi; Zhang, Shuzhong A unified adaptive tensor approximation scheme to accelerate composite convex optimization. (English) Zbl 1453.90121 SIAM J. Optim. 30, No. 4, 2897-2926 (2020). MSC: 90C25 90C59 90C60 PDF BibTeX XML Cite \textit{B. Jiang} et al., SIAM J. Optim. 30, No. 4, 2897--2926 (2020; Zbl 1453.90121) Full Text: DOI
Sahai, Tuhin Dynamical systems theory and algorithms for NP-hard problems. (English) Zbl 07271598 Junge, Oliver (ed.) et al., Advances in dynamics, optimization and computation. A volume dedicated to Michael Dellnitz on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-030-51263-7/hbk; 978-3-030-51264-4/ebook). Studies in Systems, Decision and Control 304, 183-206 (2020). MSC: 68Q 68Q17 68Q25 65Y20 90C60 37N30 PDF BibTeX XML Cite \textit{T. Sahai}, Stud. Syst. Decis. Control 304, 183--206 (2020; Zbl 07271598) Full Text: DOI
van Geffen, Bas A. M.; Jansen, Bart M. P.; de Kroon, Arnoud A. W. M.; Morel, Rolf Lower bounds for dynamic programming on planar graphs of bounded cutwidth. (English) Zbl 1446.05087 J. Graph Algorithms Appl. 24, No. 3, 461-482 (2020). MSC: 05C85 90C39 68Q17 90C60 PDF BibTeX XML Cite \textit{B. A. M. van Geffen} et al., J. Graph Algorithms Appl. 24, No. 3, 461--482 (2020; Zbl 1446.05087) Full Text: DOI
Bertsimas, Dimitris; Sturt, Bradley Computation of exact bootstrap confidence intervals: complexity and deterministic algorithms. (English) Zbl 1445.90025 Oper. Res. 68, No. 3, 949-964 (2020). MSC: 90B25 62M20 90C59 PDF BibTeX XML Cite \textit{D. Bertsimas} and \textit{B. Sturt}, Oper. Res. 68, No. 3, 949--964 (2020; Zbl 1445.90025) Full Text: DOI
Buzatu, Radu On the computational complexity of optimization convex covering problems of graphs. (English) Zbl 1445.68107 Comput. Sci. J. Mold. 28, No. 2, 187-200 (2020). MSC: 68Q25 05C70 68Q17 68R10 PDF BibTeX XML Cite \textit{R. Buzatu}, Comput. Sci. J. Mold. 28, No. 2, 187--200 (2020; Zbl 1445.68107) Full Text: Link
Larsen, Kasper Green; Weinstein, Omri; Yu, Huacheng Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. (English) Zbl 07268371 SIAM J. Comput. 49, No. 5, STOC18-323-STOC18-367 (2020). MSC: 68Q17 68P05 PDF BibTeX XML Cite \textit{K. G. Larsen} et al., SIAM J. Comput. 49, No. 5, STOC18--323-STOC18--367 (2020; Zbl 07268371) 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
Hochstättler, Winfried; Schröder, Felix; Steiner, Raphael On the complexity of digraph colourings and vertex arboricity. (English) Zbl 1452.05061 Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 4, 21 p. (2020). Reviewer: Iztok Peterin (Maribor) MSC: 05C15 05C20 68Q17 PDF BibTeX XML Cite \textit{W. Hochstättler} et al., Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 4, 21 p. (2020; Zbl 1452.05061) Full Text: DOI
Bulteau, Laurent; Froese, Vincent; Niedermeier, Rolf Tight hardness results for consensus problems on circular strings and time series. (English) Zbl 07267538 SIAM J. Discrete Math. 34, No. 3, 1854-1883 (2020). MSC: 68Q17 68T10 92D20 PDF BibTeX XML Cite \textit{L. Bulteau} et al., SIAM J. Discrete Math. 34, No. 3, 1854--1883 (2020; Zbl 07267538) Full Text: DOI
Sheng, Xingping; Chen, Jianlong An explicit representation and computation for the outer inverse. (English) Zbl 07267150 J. Southeast Univ., Engl. Ed. 36, No. 1, 118-122 (2020). MSC: 15A09 15A29 PDF BibTeX XML Cite \textit{X. Sheng} and \textit{J. Chen}, J. Southeast Univ., Engl. Ed. 36, No. 1, 118--122 (2020; Zbl 07267150) Full Text: DOI
Yu, Kai; Guo, Gong-De; Li, Jing; Lin, Song Quantum algorithms for similarity measurement based on Euclidean distance. (English) Zbl 1450.81029 Int. J. Theor. Phys. 59, No. 10, 3134-3144 (2020). MSC: 81P68 68T05 68Q32 68P15 68Q06 68P10 PDF BibTeX XML Cite \textit{K. Yu} et al., Int. J. Theor. Phys. 59, No. 10, 3134--3144 (2020; Zbl 1450.81029) Full Text: DOI
Pilz, Alexander; Welzl, Emo; Wettstein, Manuel From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices. (English) Zbl 1450.05016 Discrete Comput. Geom. 64, No. 3, 1067-1097 (2020). MSC: 05C10 05C62 05C30 52C99 68U05 68Q25 PDF BibTeX XML Cite \textit{A. Pilz} et al., Discrete Comput. Geom. 64, No. 3, 1067--1097 (2020; Zbl 1450.05016) Full Text: DOI