Nagasaka, Kosaku Toward the best algorithm for approximate GCD of univariate polynomials. (English) Zbl 07312662 J. Symb. Comput. 105, 4-27 (2021). MSC: 65F 68W 15B PDF BibTeX XML Cite \textit{K. Nagasaka}, J. Symb. Comput. 105, 4--27 (2021; Zbl 07312662) Full Text: DOI
Nagasaka, Kosaku Approximate square-free part and decomposition. (English) Zbl 07312488 J. Symb. Comput. 104, 402-418 (2021). MSC: 65 65F 15A 15B 11Y PDF BibTeX XML Cite \textit{K. Nagasaka}, J. Symb. Comput. 104, 402--418 (2021; Zbl 07312488) Full Text: DOI
Shang, Jianhui; Li, Peng; Shi, Yi The longest cycle problem is polynomial on interval graphs. (English) Zbl 07310528 Theor. Comput. Sci. 859, 37-47 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{J. Shang} et al., Theor. Comput. Sci. 859, 37--47 (2021; Zbl 07310528) Full Text: DOI
Iwata, Satoru; Kobayashi, Yusuke A weighted linear matroid parity algorithm. (English) Zbl 07307636 SIAM J. Comput. 50, STOC17-238-STOC17-280 (2021). MSC: 90C27 PDF BibTeX XML Cite \textit{S. Iwata} and \textit{Y. Kobayashi}, SIAM J. Comput. 50, STOC17--238-STOC17--280 (2021; Zbl 07307636) 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
Nguyen, Trung Thanh; Rothe, Jörg Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. (English) Zbl 07305078 Theor. Comput. Sci. 858, 35-48 (2021). MSC: 90B35 68W25 68M20 90C05 PDF BibTeX XML Cite \textit{T. T. Nguyen} and \textit{J. Rothe}, Theor. Comput. Sci. 858, 35--48 (2021; Zbl 07305078) Full Text: DOI
Gao, Alice L. L.; Lu, Linyuan; Xie, Matthew H. Y.; Yang, Arthur L. B.; Zhang, Philip B. The Kazhdan-Lusztig polynomials of uniform matroids. (English) Zbl 07304619 Adv. Appl. Math. 122, Article ID 102117, 24 p. (2021). MSC: 05B35 52B40 05A15 26C10 33F10 PDF BibTeX XML Cite \textit{A. L. L. Gao} et al., Adv. Appl. Math. 122, Article ID 102117, 24 p. (2021; Zbl 07304619) Full Text: DOI
Chudnovsky, Maria; Huang, Shenwei; Spirkl, Sophie; Zhong, Mingxian List 3-coloring graphs with no induced \(P_6 + rP_3\). (English) Zbl 07303848 Algorithmica 83, No. 1, 216-251 (2021). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Chudnovsky} et al., Algorithmica 83, No. 1, 216--251 (2021; Zbl 07303848) 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
Panda, B. S.; Goyal, Pooja Global total \(k\)-domination: approximation and hardness results. (English) Zbl 07286326 Theor. Comput. Sci. 850, 1-19 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{P. Goyal}, Theor. Comput. Sci. 850, 1--19 (2021; Zbl 07286326) Full Text: DOI
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos On the fast delivery problem with one or two packages. (English) Zbl 07265478 J. Comput. Syst. Sci. 115, 246-263 (2021). MSC: 68 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., J. Comput. Syst. Sci. 115, 246--263 (2021; Zbl 07265478) Full Text: DOI
Sui, Xiang An algorithm for computing least-squares function-valued Padé-type approximation. (English) Zbl 07264163 Int. J. Math. Comput. Sci. 16, No. 1, 1-8 (2021). MSC: 45B05 35B27 PDF BibTeX XML Cite \textit{X. Sui}, Int. J. Math. Comput. Sci. 16, No. 1, 1--8 (2021; Zbl 07264163) Full Text: Link
Takagi, Tsuyoshi (ed.); Wakayama, Masato (ed.); Tanaka, Keisuke (ed.); Kunihiro, Noboru (ed.); Kimoto, Kazufumi (ed.); Ikematsu, Yasuhiko (ed.) International symposium on mathematics, quantum theory, and cryptography. Proceedings of MQC 2019, Fukuoka, Japan, September 25–27, 2019. (English) Zbl 07214671 Mathematics for Industry 33. Singapore: Springer (ISBN 978-981-15-5190-1/hbk; 978-981-15-5191-8/ebook). xii, 274 p. open access (2021). MSC: 94-06 94A60 00B25 81P68 81P94 PDF BibTeX XML Cite \textit{T. Takagi} (ed.) et al., International symposium on mathematics, quantum theory, and cryptography. Proceedings of MQC 2019, Fukuoka, Japan, September 25--27, 2019. Singapore: Springer (2021; Zbl 07214671) Full Text: DOI
Khandeev, Vladimir; Panasenko, Anna Exact algorithm for the one-dimensional quadratic Euclidean cardinality-weighted 2-clustering with given center problem. (English) Zbl 07315669 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, 30-35 (2020). MSC: 90 68 91 PDF BibTeX XML Cite \textit{V. Khandeev} and \textit{A. Panasenko}, Commun. Comput. Inf. Sci. 1275, 30--35 (2020; Zbl 07315669) Full Text: DOI
Sholomov, L. A. Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form. (English. Russian original) Zbl 07312364 Probl. Inf. Transm. 56, No. 4, 373-387 (2020); translation from Probl. Peredachi Inf. 56, No. 4, 81-96 (2020). MSC: 94 PDF BibTeX XML Cite \textit{L. A. Sholomov}, Probl. Inf. Transm. 56, No. 4, 373--387 (2020; Zbl 07312364); translation from Probl. Peredachi Inf. 56, No. 4, 81--96 (2020) Full Text: DOI
Zhang, Binwu; Guan, Xiucui; Zhang, Qiao Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm. (English) Zbl 07311818 Optim. Lett. 14, No. 8, 2301-2322 (2020). MSC: 90C PDF BibTeX XML Cite \textit{B. Zhang} et al., Optim. Lett. 14, No. 8, 2301--2322 (2020; Zbl 07311818) Full Text: DOI
Furue, Hiroki; Hirai, Hiroshi On a weighted linear matroid intersection algorithm by Deg-Det computation. (English) Zbl 07309986 Japan J. Ind. Appl. Math. 37, No. 3, 677-696 (2020). MSC: 68W40 PDF BibTeX XML Cite \textit{H. Furue} and \textit{H. Hirai}, Japan J. Ind. Appl. Math. 37, No. 3, 677--696 (2020; Zbl 07309986) Full Text: DOI
Zinder, Y.; Lazarev, A. A.; Musatova, E. G. Rescheduling traffic on a partially blocked segment of railway with a siding. (English. Russian original) Zbl 07294492 Autom. Remote Control 81, No. 6, 955-966 (2020); translation from Avtom. Telemekh. 2020, No. 6, 91-105 (2020). MSC: 90B35 90C39 PDF BibTeX XML Cite \textit{Y. Zinder} et al., Autom. Remote Control 81, No. 6, 955--966 (2020; Zbl 07294492); translation from Avtom. Telemekh. 2020, No. 6, 91--105 (2020) 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
Kel’manov, A. V.; Mikhailova, L. V.; Ruzankin, P. S.; Khamidullin, S. A. Problem of minimizing a sum of differences of weighted convolutions. (English. Russian original) Zbl 07291187 Comput. Math. Math. Phys. 60, No. 12, 1951-1963 (2020); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 12, 2015-2027 (2020). MSC: 94 65 PDF BibTeX XML Cite \textit{A. V. Kel'manov} et al., Comput. Math. Math. Phys. 60, No. 12, 1951--1963 (2020; Zbl 07291187); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 12, 2015--2027 (2020) Full Text: DOI
Kuroki, Yuko; Xu, Liyuan; Miyauchi, Atsushi; Honda, Junya; Sugiyama, Masashi Polynomial-time algorithms for multiple-arm identification with full-bandit feedback. (English) Zbl 07289991 Neural Comput. 32, No. 9, 1733-1773 (2020). MSC: 91B06 91B86 60C99 68W25 PDF BibTeX XML Cite \textit{Y. Kuroki} et al., Neural Comput. 32, No. 9, 1733--1773 (2020; Zbl 07289991) Full Text: DOI
Dehghan, Ali; Banihashemi, Amir H. On finding bipartite graphs with a small number of short cycles and large girth. (English) Zbl 1452.05093 IEEE Trans. Inf. Theory 66, No. 10, 6024-6036 (2020). MSC: 05C38 94B05 05C65 05C75 05C85 PDF BibTeX XML Cite \textit{A. Dehghan} and \textit{A. H. Banihashemi}, IEEE Trans. Inf. Theory 66, No. 10, 6024--6036 (2020; Zbl 1452.05093) Full Text: DOI
Dimitrov, Dimitar K.; Peixoto, Lourenço L. An efficient algorithm for the classical least squares approximation. (English) Zbl 1452.65032 SIAM J. Sci. Comput. 42, No. 5, A3233-A3249 (2020). MSC: 65D10 65D30 65H04 PDF BibTeX XML Cite \textit{D. K. Dimitrov} and \textit{L. L. Peixoto}, SIAM J. Sci. Comput. 42, No. 5, A3233--A3249 (2020; Zbl 1452.65032) Full Text: DOI
Harutyunyan, A.; Lampis, M.; Lozin, V.; Monnot, J. Maximum independent sets in subcubic graphs: new results. (English) Zbl 07270950 Theor. Comput. Sci. 846, 14-26 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{A. Harutyunyan} et al., Theor. Comput. Sci. 846, 14--26 (2020; Zbl 07270950) Full Text: DOI
Thiemann, René; Bottesch, Ralph; Divasón, Jose; Haslbeck, Max W.; Joosten, Sebastiaan J. C.; Yamada, Akihisa Formalizing the LLL basis reduction algorithm and the LLL factorization algorithm in Isabelle/HOL. (English) Zbl 07268888 J. Autom. Reasoning 64, No. 5, 827-856 (2020). MSC: 68V15 PDF BibTeX XML Cite \textit{R. Thiemann} et al., J. Autom. Reasoning 64, No. 5, 827--856 (2020; Zbl 07268888) Full Text: DOI
Hell, Pavol; Huang, Jing; Lin, Jephian C.-H.; McConnell, Ross M. Bipartite analogues of comparability and cocomparability graphs. (English) Zbl 1450.05089 SIAM J. Discrete Math. 34, No. 3, 1969-1983 (2020). MSC: 05C99 05C75 05C85 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1969--1983 (2020; Zbl 1450.05089) Full Text: DOI
Bezáková, Ivona; Galanis, Andreas; Goldberg, Leslie Ann; Štefankovič, Daniel Inapproximability of the independent set polynomial in the complex plane. (English) Zbl 07266061 SIAM J. Comput. 49, No. 5, STOC18-395-STOC18-448 (2020). MSC: 68Q17 68Q87 PDF BibTeX XML Cite \textit{I. Bezáková} et al., SIAM J. Comput. 49, No. 5, STOC18--395-STOC18--448 (2020; Zbl 07266061) Full Text: DOI
Aronov, Boris; Miller, Edward Y.; Sharir, Micha Eliminating depth cycles among triangles in three dimensions. (English) Zbl 07264921 Discrete Comput. Geom. 64, No. 3, 627-653 (2020). MSC: 68U05 52C99 52C35 PDF BibTeX XML Cite \textit{B. Aronov} et al., Discrete Comput. Geom. 64, No. 3, 627--653 (2020; Zbl 07264921) Full Text: DOI
Tao, Yuegang; Wang, Cailu Global optimization for max-plus linear systems and applications in distributed systems. (English) Zbl 07264640 Automatica 119, Article ID 109104, 6 p. (2020). MSC: 90C26 PDF BibTeX XML Cite \textit{Y. Tao} and \textit{C. Wang}, Automatica 119, Article ID 109104, 6 p. (2020; Zbl 07264640) Full Text: DOI
Xiao, Mingyu; Nagamochi, Hiroshi Characterizing star-PCGs. (English) Zbl 07259205 Algorithmica 82, No. 10, 3066-3090 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{M. Xiao} and \textit{H. Nagamochi}, Algorithmica 82, No. 10, 3066--3090 (2020; Zbl 07259205) Full Text: DOI
M.-Alizadeh, Benyamin; Hashemi, Amir Deterministic normal position transformation and its applications. (English) Zbl 07259073 Theor. Comput. Sci. 842, 50-64 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{B. M. -Alizadeh} and \textit{A. Hashemi}, Theor. Comput. Sci. 842, 50--64 (2020; Zbl 07259073) Full Text: DOI
Darvay, Zsolt; Illés, Tibor; Povh, Janez; Rigó, Petra Renáta Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction. (English) Zbl 1451.90161 SIAM J. Optim. 30, No. 3, 2628-2658 (2020). MSC: 90C33 90C51 PDF BibTeX XML Cite \textit{Z. Darvay} et al., SIAM J. Optim. 30, No. 3, 2628--2658 (2020; Zbl 1451.90161) Full Text: DOI
Kel’manov, Alexander; Khamidullin, Sergey; Panasenko, Anna 2-approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence. (English) Zbl 07250772 Sergeyev, Yaroslav D. (ed.) et al., Numerical computations: theory and algorithms. Third international conference, NUMTA 2019, Crotone, Italy, June 15–21, 2019. Revised selected papers. Part II. Cham: Springer (ISBN 978-3-030-40615-8/pbk; 978-3-030-40616-5/ebook). Lecture Notes in Computer Science 11974, 386-393 (2020). MSC: 65 PDF BibTeX XML Cite \textit{A. Kel'manov} et al., Lect. Notes Comput. Sci. 11974, 386--393 (2020; Zbl 07250772) Full Text: DOI
Egidi, Nadaniela; Fatone, Lorella; Misici, Luciano A new Remez-type algorithm for best polynomial approximation. (English) Zbl 07249917 Sergeyev, Yaroslav D. (ed.) et al., Numerical computations: theory and algorithms. Third international conference, NUMTA 2019, Crotone, Italy, June 15–21, 2019. Revised selected papers. Part I. Cham: Springer (ISBN 978-3-030-39080-8/pbk; 978-3-030-39081-5/ebook). Lecture Notes in Computer Science 11973, 56-69 (2020). MSC: 65 PDF BibTeX XML Cite \textit{N. Egidi} et al., Lect. Notes Comput. Sci. 11973, 56--69 (2020; Zbl 07249917) Full Text: DOI
Jha, Anupriya; Pradhan, D.; Banerjee, S. Algorithm and hardness results on neighborhood total domination in graphs. (English) Zbl 07248833 Theor. Comput. Sci. 840, 16-32 (2020). MSC: 68Q PDF BibTeX XML Cite \textit{A. Jha} et al., Theor. Comput. Sci. 840, 16--32 (2020; Zbl 07248833) Full Text: DOI
Akrida, Eleni C.; Mertzios, George B.; Nikoletseas, Sotiris; Raptopoulos, Christoforos; Spirakis, Paul G.; Zamaraev, Viktor How fast can we reach a target vertex in stochastic temporal graphs? (English) Zbl 07244279 J. Comput. Syst. Sci. 114, 65-83 (2020). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 68Q87 68W25 PDF BibTeX XML Cite \textit{E. C. Akrida} et al., J. Comput. Syst. Sci. 114, 65--83 (2020; Zbl 07244279) Full Text: DOI
Fang, Zhi-Wei; Sun, Hai-Wei; Wang, Hong A fast method for variable-order Caputo fractional derivative with applications to time-fractional diffusion equations. (English) Zbl 1447.65022 Comput. Math. Appl. 80, No. 5, 1443-1458 (2020). MSC: 65M06 65M12 65M15 35R11 26A33 PDF BibTeX XML Cite \textit{Z.-W. Fang} et al., Comput. Math. Appl. 80, No. 5, 1443--1458 (2020; Zbl 1447.65022) Full Text: DOI
Gritzmann, Peter; Langfeld, Barbara On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity. (English) Zbl 07242477 Discrete Comput. Geom. 64, No. 2, 290-303 (2020). MSC: 68R05 05C70 15B33 68Q17 68Q25 PDF BibTeX XML Cite \textit{P. Gritzmann} and \textit{B. Langfeld}, Discrete Comput. Geom. 64, No. 2, 290--303 (2020; Zbl 07242477) Full Text: DOI
Konstantinidis, Athanasios L.; Papadopoulos, Charis Maximizing the strong triadic closure in split graphs and proper interval graphs. (English) Zbl 1446.05080 Discrete Appl. Math. 285, 79-95 (2020). MSC: 05C78 05C75 05C85 68Q17 91D30 PDF BibTeX XML Cite \textit{A. L. Konstantinidis} and \textit{C. Papadopoulos}, Discrete Appl. Math. 285, 79--95 (2020; Zbl 1446.05080) Full Text: DOI
Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V. On the impact of running intersection inequalities for globally solving polynomial optimization problems. (English) Zbl 1441.90097 Math. Program. Comput. 12, No. 2, 165-191 (2020). MSC: 90C11 90C26 90C57 PDF BibTeX XML Cite \textit{A. Del Pia} et al., Math. Program. Comput. 12, No. 2, 165--191 (2020; Zbl 1441.90097) Full Text: DOI
Holt, Derek; Leedham-Green, C. R.; O’Brien, E. A. Constructing composition factors for a linear group in polynomial time. (English) Zbl 07239066 J. Algebra 561, 215-236 (2020). MSC: 20 16 PDF BibTeX XML Cite \textit{D. Holt} et al., J. Algebra 561, 215--236 (2020; Zbl 07239066) Full Text: DOI
Kreuzer, Martin; Xiu, Xingqiang Noncommutative Gebauer-Möller criteria. (English) Zbl 07237951 Baginski, Paul (ed.) et al., Elementary theory of groups and group rings, and related topics. Proceedings of the conference held at Fairfield University and at the Graduate Center, CUNY, New York, NY, USA, November 1–2, 2018. Berlin: De Gruyter (ISBN 978-3-11-063673-4/hbk; 978-3-11-063838-7/ebook). De Gruyter Proceedings in Mathematics, 149-176 (2020). MSC: 16S36 16Z05 PDF BibTeX XML Cite \textit{M. Kreuzer} and \textit{X. Xiu}, in: Elementary theory of groups and group rings, and related topics. Proceedings of the conference held at Fairfield University and at the Graduate Center, CUNY, New York, NY, USA, November 1--2, 2018. Berlin: De Gruyter. 149--176 (2020; Zbl 07237951) Full Text: DOI
Ekim, Tınaz; Gözüpek, Didem; Hujdurović, Ademir; Milanič, Martin Mind the independence gap. (English) Zbl 1443.05141 Discrete Math. 343, No. 9, Article ID 111943, 10 p. (2020). MSC: 05C69 05C70 05C85 PDF BibTeX XML Cite \textit{T. Ekim} et al., Discrete Math. 343, No. 9, Article ID 111943, 10 p. (2020; Zbl 1443.05141) Full Text: DOI
Ponomarenko, Ilia; Vasil’ev, Andrey Two-closures of supersolvable permutation groups in polynomial time. (English) Zbl 07218638 Comput. Complexity 29, No. 1, Paper No. 5, 33 p. (2020). MSC: 20B25 20B40 PDF BibTeX XML Cite \textit{I. Ponomarenko} and \textit{A. Vasil'ev}, Comput. Complexity 29, No. 1, Paper No. 5, 33 p. (2020; Zbl 07218638) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time. (English) Zbl 1443.05137 Discrete Appl. Math. 284, 269-280 (2020). MSC: 05C69 05C70 05C85 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 284, 269--280 (2020; Zbl 1443.05137) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time. (English) Zbl 1442.05171 Discrete Appl. Math. 283, 417-434 (2020). MSC: 05C70 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 283, 417--434 (2020; Zbl 1442.05171) Full Text: DOI
Enriquez, Nathanaël; Faraud, Gabriel; Ménard, Laurent Limiting shape of the depth first search tree in an Erdős-Rényi graph. (English) Zbl 1436.05096 Random Struct. Algorithms 56, No. 2, 501-516 (2020). MSC: 05C80 05D40 PDF BibTeX XML Cite \textit{N. Enriquez} et al., Random Struct. Algorithms 56, No. 2, 501--516 (2020; Zbl 1436.05096) Full Text: DOI
Bousla, Sid Ali; Farhi, Bakir Nontrivial effective lower bounds for the least common multiple of some quadratic sequences. (English) Zbl 1448.11005 J. Integer Seq. 23, No. 6, Article 20.6.6, 18 p. (2020). MSC: 11A05 11B83 13F20 PDF BibTeX XML Cite \textit{S. A. Bousla} and \textit{B. Farhi}, J. Integer Seq. 23, No. 6, Article 20.6.6, 18 p. (2020; Zbl 1448.11005) Full Text: Link
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1450.05073 J. Comput. Syst. Sci. 113, 60-75 (2020). MSC: 05C76 05C70 PDF BibTeX XML Cite \textit{B. Martin} et al., J. Comput. Syst. Sci. 113, 60--75 (2020; Zbl 1450.05073) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1440.05158 Discrete Appl. Math. 281, 81-95 (2020). MSC: 05C69 68Q17 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 281, 81--95 (2020; Zbl 1440.05158) Full Text: DOI
Horáček, Jan; Kreuzer, Martin; Messeng Ekossono, Ange-Salomé A signature based border basis algorithm. (English) Zbl 07205392 Math. Comput. Sci. 14, No. 1, 177-189 (2020). MSC: 13P10 06E99 13P15 PDF BibTeX XML Cite \textit{J. Horáček} et al., Math. Comput. Sci. 14, No. 1, 177--189 (2020; Zbl 07205392) Full Text: DOI
Alon, Noga; Bang-Jensen, Jørgen; Bessy, Stéphane Out-colourings of digraphs. (English) Zbl 07202746 J. Graph Theory 93, No. 1, 88-112 (2020). MSC: 05C PDF BibTeX XML Cite \textit{N. Alon} et al., J. Graph Theory 93, No. 1, 88--112 (2020; Zbl 07202746) Full Text: DOI
Mostafaee, Amin; Soleimani-Damaneh, Majid Closed form of the response function in FDH technologies: theory, computation and application. (English) Zbl 1443.90283 RAIRO, Oper. Res. 54, No. 1, 53-68 (2020). MSC: 90C26 90C90 91B84 PDF BibTeX XML Cite \textit{A. Mostafaee} and \textit{M. Soleimani-Damaneh}, RAIRO, Oper. Res. 54, No. 1, 53--68 (2020; Zbl 1443.90283) Full Text: DOI
Dubey, Dipti; Neogy, S. K. On solving a non-convex quadratic programming problem involving resistance distances in graphs. (English) Zbl 1437.90155 Ann. Oper. Res. 287, No. 2, 643-651 (2020). MSC: 90C35 90C20 90C26 PDF BibTeX XML Cite \textit{D. Dubey} and \textit{S. K. Neogy}, Ann. Oper. Res. 287, No. 2, 643--651 (2020; Zbl 1437.90155) Full Text: DOI
Luo, Wen-Chang On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs. (English) Zbl 1449.90114 J. Oper. Res. Soc. China 8, No. 1, 165-175 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{W.-C. Luo}, J. Oper. Res. Soc. China 8, No. 1, 165--175 (2020; Zbl 1449.90114) Full Text: DOI
Char, Ian G.; Lladser, Manuel E. Stochastic analysis of minimal automata growth for generalized strings. (English) Zbl 1434.68240 Methodol. Comput. Appl. Probab. 22, No. 1, 329-347 (2020). MSC: 68Q45 68Q87 68W40 PDF BibTeX XML Cite \textit{I. G. Char} and \textit{M. E. Lladser}, Methodol. Comput. Appl. Probab. 22, No. 1, 329--347 (2020; Zbl 1434.68240) Full Text: DOI
Iwata, Satoru; Yokoi, Yu Finding a stable allocation in polymatroid intersection. (English) Zbl 1434.91045 Math. Oper. Res. 45, No. 1, 63-85 (2020). MSC: 91B68 52B40 PDF BibTeX XML Cite \textit{S. Iwata} and \textit{Y. Yokoi}, Math. Oper. Res. 45, No. 1, 63--85 (2020; Zbl 1434.91045) Full Text: DOI
Giaro, Krzysztof; Kubale, Marek A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\). (English) Zbl 1439.05086 Discuss. Math., Graph Theory 40, No. 3, 885-891 (2020). MSC: 05C15 05C85 PDF BibTeX XML Cite \textit{K. Giaro} and \textit{M. Kubale}, Discuss. Math., Graph Theory 40, No. 3, 885--891 (2020; Zbl 1439.05086) Full Text: DOI
Del Pia, Alberto; Dey, Santanu S.; Weismantel, Robert Subset selection in sparse matrices. (English) Zbl 1441.90125 SIAM J. Optim. 30, No. 2, 1173-1190 (2020). MSC: 90C26 PDF BibTeX XML Cite \textit{A. Del Pia} et al., SIAM J. Optim. 30, No. 2, 1173--1190 (2020; Zbl 1441.90125) Full Text: DOI
Messaoudi, A.; Sadaka, R.; Sadok, H. Matrix recursive polynomial interpolation algorithm: an algorithm for computing the interpolation polynomials. (English) Zbl 07193292 J. Comput. Appl. Math. 373, Article ID 112471, 9 p. (2020). MSC: 65D05 65D15 65D20 PDF BibTeX XML Cite \textit{A. Messaoudi} et al., J. Comput. Appl. Math. 373, Article ID 112471, 9 p. (2020; Zbl 07193292) Full Text: DOI
Sidki, S.; Sadaka, R.; Benazzouz, A. Computing recursive orthogonal polynomial with Schur complements. (English) Zbl 07193287 J. Comput. Appl. Math. 373, Article ID 112406, 17 p. (2020). MSC: 65D20 33C45 PDF BibTeX XML Cite \textit{S. Sidki} et al., J. Comput. Appl. Math. 373, Article ID 112406, 17 p. (2020; Zbl 07193287) Full Text: DOI
Chen, Yuzhu; Hu, Xun; Kitov, Nikita V.; Luo, Yanfeng; Volkov, Mikhail V. Identities of the Kauffman monoid \(\mathcal{K}_3\). (English) Zbl 07192160 Commun. Algebra 48, No. 5, 1956-1968 (2020). Reviewer: Peter R. Jones (Milwaukee) MSC: 20M05 20M07 PDF BibTeX XML Cite \textit{Y. Chen} et al., Commun. Algebra 48, No. 5, 1956--1968 (2020; Zbl 07192160) Full Text: DOI
Brandstädt, Andreas; Mosca, Raffaele Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs. (English) Zbl 1437.05189 Discrete Appl. Math. 278, 83-92 (2020). MSC: 05C70 05C69 05C85 68Q17 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 278, 83--92 (2020; Zbl 1437.05189) Full Text: DOI
Földvári, Attila; Horváth, Gábor The complexity of the equation solvability and equivalence problems over finite groups. (English) Zbl 07190124 Int. J. Algebra Comput. 30, No. 3, 607-623 (2020). MSC: 20F10 20F14 20F16 13P15 PDF BibTeX XML Cite \textit{A. Földvári} and \textit{G. Horváth}, Int. J. Algebra Comput. 30, No. 3, 607--623 (2020; Zbl 07190124) Full Text: DOI
Yokoi, Yu Envy-free matchings with lower quotas. (English) Zbl 1433.91099 Algorithmica 82, No. 2, 188-211 (2020). MSC: 91B68 PDF BibTeX XML Cite \textit{Y. Yokoi}, Algorithmica 82, No. 2, 188--211 (2020; Zbl 1433.91099) Full Text: DOI
Mehta, Ruta; Vazirani, Vijay V. An incentive compatible, efficient market for air traffic flow management. (English) Zbl 1436.91088 Theor. Comput. Sci. 818, 41-50 (2020). MSC: 91B68 90B20 90B35 PDF BibTeX XML Cite \textit{R. Mehta} and \textit{V. V. Vazirani}, Theor. Comput. Sci. 818, 41--50 (2020; Zbl 1436.91088) Full Text: DOI
Elbassioni, Khaled; Makino, Kazuhisa Enumerating vertices of covering polyhedra with totally unimodular constraint matrices. (English) Zbl 1432.68324 SIAM J. Discrete Math. 34, No. 1, 843-864 (2020). MSC: 68R05 05C65 52B05 52B55 68R10 68U05 68W40 PDF BibTeX XML Cite \textit{K. Elbassioni} and \textit{K. Makino}, SIAM J. Discrete Math. 34, No. 1, 843--864 (2020; Zbl 1432.68324) Full Text: DOI
Mérai, László Values of rational functions in small subgroups of finite fields and the identity testing problem from powers. (English) Zbl 07182418 Int. J. Number Theory 16, No. 2, 219-231 (2020). MSC: 11T06 11Y16 68Q25 PDF BibTeX XML Cite \textit{L. Mérai}, Int. J. Number Theory 16, No. 2, 219--231 (2020; Zbl 07182418) Full Text: DOI
Zhao, Qiulan; Yuan, Jinjiang Bicriteria scheduling of equal length jobs on uniform parallel machines. (English) Zbl 1442.90090 J. Comb. Optim. 39, No. 3, 637-661 (2020). MSC: 90B35 PDF BibTeX XML Cite \textit{Q. Zhao} and \textit{J. Yuan}, J. Comb. Optim. 39, No. 3, 637--661 (2020; Zbl 1442.90090) Full Text: DOI
Papadopoulos, Charis; Tzimas, Spyridon Subset feedback vertex set on graphs of bounded independent set size. (English) Zbl 1435.68244 Theor. Comput. Sci. 814, 177-188 (2020). MSC: 68R10 05C69 05C85 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{C. Papadopoulos} and \textit{S. Tzimas}, Theor. Comput. Sci. 814, 177--188 (2020; Zbl 1435.68244) Full Text: DOI
Abelard, Simon Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus. (English) Zbl 1432.11065 J. Complexity 57, Article ID 101440, 22 p. (2020). MSC: 11G20 11Y16 14G05 94A60 PDF BibTeX XML Cite \textit{S. Abelard}, J. Complexity 57, Article ID 101440, 22 p. (2020; Zbl 1432.11065) Full Text: DOI
Dobrev, Stefan; Kranakis, Evangelos; Krizanc, Danny; Lafond, Manuel; Maňuch, Ján; Narayanan, Lata; Opatrny, Jaroslav; Stacho, Ladislav Weak coverage of a rectangular barrier. (English) Zbl 1435.68342 Algorithmica 82, No. 4, 721-746 (2020). MSC: 68U05 68M18 68Q17 68W40 90B80 PDF BibTeX XML Cite \textit{S. Dobrev} et al., Algorithmica 82, No. 4, 721--746 (2020; Zbl 1435.68342) Full Text: DOI
Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav Fixed-parameter tractable algorithm and polynomial kernel for Max-Cut Above Spanning Tree. (English) Zbl 1434.68748 Theory Comput. Syst. 64, No. 1, 62-100 (2020). MSC: 68W40 05C85 68Q27 68R10 PDF BibTeX XML Cite \textit{J. Madathil} et al., Theory Comput. Syst. 64, No. 1, 62--100 (2020; Zbl 1434.68748) Full Text: DOI
Defant, Colin Counting 3-stack-sortable permutations. (English) Zbl 1433.05005 J. Comb. Theory, Ser. A 172, Article ID 105209, 26 p. (2020). MSC: 05A05 05A15 PDF BibTeX XML Cite \textit{C. Defant}, J. Comb. Theory, Ser. A 172, Article ID 105209, 26 p. (2020; Zbl 1433.05005) Full Text: DOI
Mizunashi, Koichi; Horiyama, Takashi; Uehara, Ryuhei Efficient algorithm for box folding. (English) Zbl 1434.51017 J. Graph Algorithms Appl. 24, No. 2, 89-103 (2020). MSC: 51M15 65D18 PDF BibTeX XML Cite \textit{K. Mizunashi} et al., J. Graph Algorithms Appl. 24, No. 2, 89--103 (2020; Zbl 1434.51017) Full Text: DOI
Malek, Sabrine; Naanaa, Wady A new approximate cluster deletion algorithm for diamond-free graphs. (English) Zbl 1434.90172 J. Comb. Optim. 39, No. 2, 385-411 (2020). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{S. Malek} and \textit{W. Naanaa}, J. Comb. Optim. 39, No. 2, 385--411 (2020; Zbl 1434.90172) Full Text: DOI
Banerjee, Sumanta; Henning, Michael A.; Pradhan, D. Algorithmic results on double Roman domination in graphs. (English) Zbl 1434.05105 J. Comb. Optim. 39, No. 1, 90-114 (2020). MSC: 05C69 90C35 05C35 68Q17 PDF BibTeX XML Cite \textit{S. Banerjee} et al., J. Comb. Optim. 39, No. 1, 90--114 (2020; Zbl 1434.05105) Full Text: DOI
Sawa, Kaoru; Nakamura, Yoshimasa Extension of the Lanczos-Phillips algorithm with Laurent biorthogonal polynomials and its application to the Thron continued fractions. (English) Zbl 07158295 JSIAM Lett. 12, 1-4 (2020). MSC: 65 41 PDF BibTeX XML Cite \textit{K. Sawa} and \textit{Y. Nakamura}, JSIAM Lett. 12, 1--4 (2020; Zbl 07158295) Full Text: DOI
Takayama, Koki; Kobayashi, Yusuke A strongly polynomial time algorithm for the maximum supply rate problem on trees. (English) Zbl 1436.68261 Theor. Comput. Sci. 806, 323-331 (2020). MSC: 68R10 05C05 05C70 05C85 68W40 90B06 90B10 90C39 PDF BibTeX XML Cite \textit{K. Takayama} and \textit{Y. Kobayashi}, Theor. Comput. Sci. 806, 323--331 (2020; Zbl 1436.68261) Full Text: DOI
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDF BibTeX XML Cite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI
Barvinok, Alexander Stability and complexity of mixed discriminants. (English) Zbl 1442.15008 Math. Comput. 89, No. 322, 717-735 (2020). MSC: 15A15 15A45 15A63 68W25 PDF BibTeX XML Cite \textit{A. Barvinok}, Math. Comput. 89, No. 322, 717--735 (2020; Zbl 1442.15008) Full Text: DOI arXiv
Henning, Michael A.; Pradhan, D. Algorithmic aspects of upper paired-domination in graphs. (English) Zbl 1436.68242 Theor. Comput. Sci. 804, 98-114 (2020). MSC: 68R10 05C69 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{D. Pradhan}, Theor. Comput. Sci. 804, 98--114 (2020; Zbl 1436.68242) Full Text: DOI
Ji, Meng; Li, Xueliang; Zhu, Xiaoyu (Strong) conflict-free connectivity: algorithm and complexity. (English) Zbl 1436.68243 Theor. Comput. Sci. 804, 72-80 (2020). MSC: 68R10 05C15 05C50 05C85 68Q17 68W40 PDF BibTeX XML Cite \textit{M. Ji} et al., Theor. Comput. Sci. 804, 72--80 (2020; Zbl 1436.68243) Full Text: DOI
Liu, Longcheng; Chen, Yong; Dong, Jianming; Goebel, Randy; Lin, Guohui; Luo, Yue; Ni, Guanqun; Su, Bing; Xu, Yao; Zhang, An Approximation algorithms for the three-machine proportionate mixed shop scheduling. (English) Zbl 1444.90055 Theor. Comput. Sci. 803, 57-70 (2020). Reviewer: Frank Werner (Magdeburg) MSC: 90B35 68M20 90C59 PDF BibTeX XML Cite \textit{L. Liu} et al., Theor. Comput. Sci. 803, 57--70 (2020; Zbl 1444.90055) Full Text: DOI
Henning, Michael A.; Pal, Saikat; Pradhan, D. Algorithm and hardness results on hop domination in graphs. (English) Zbl 07134469 Inf. Process. Lett. 153, Article ID 105872, 8 p. (2020). MSC: 68Q PDF BibTeX XML Cite \textit{M. A. Henning} et al., Inf. Process. Lett. 153, Article ID 105872, 8 p. (2020; Zbl 07134469) Full Text: DOI
Shen, Wen An introduction to numerical computation. 2nd edition. (English) Zbl 07102013 Hackensack, NJ: World Scientific (ISBN 978-981-12-0441-8/hbk; 978-981-120-518-7/pbk; 978-981-12-0443-2/ebook). xv, 322 p. (2020). Reviewer: Calin Ioan Gheorghiu (Cluj-Napoca) MSC: 65-01 65Dxx 65Lxx 65Mxx 65Nxx 65Rxx 65T40 65T50 65F15 PDF BibTeX XML Cite \textit{W. Shen}, An introduction to numerical computation. 2nd edition. Hackensack, NJ: World Scientific (2020; Zbl 07102013) Full Text: DOI
Guo, Zeyu Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes. (English) Zbl 1426.11135 J. Symb. Comput. 96, 22-61 (2020). MSC: 11Y16 11Y40 11T06 13P05 68W30 PDF BibTeX XML Cite \textit{Z. Guo}, J. Symb. Comput. 96, 22--61 (2020; Zbl 1426.11135) Full Text: DOI
Ganesh, M.; Hawkins, S. C.; Volkov, D. An efficient algorithm for a class of stochastic forward and inverse Maxwell models in \(\mathbb{R}^3\). (English) Zbl 07302201 J. Comput. Phys. 398, Article ID 108881, 33 p. (2019). MSC: 65C30 65N21 35R60 60H15 78A25 78M10 PDF BibTeX XML Cite \textit{M. Ganesh} et al., J. Comput. Phys. 398, Article ID 108881, 33 p. (2019; Zbl 07302201) Full Text: DOI
Yue, Jun; Ge, Wei The independent transversal total domination number of some graphs. (English) Zbl 1452.05135 Util. Math. 112, 111-124 (2019). MSC: 05C69 05C75 05C85 PDF BibTeX XML Cite \textit{J. Yue} and \textit{W. Ge}, Util. Math. 112, 111--124 (2019; Zbl 1452.05135)
Wang, Zhouhong; Dai, Yuhong; Xu, Fengmin A robust interior point method for computing the analytic center of an ill-conditioned polytope with errors. (English) Zbl 07266715 J. Comput. Math. 37, No. 6, 843-865 (2019). MSC: 90C51 PDF BibTeX XML Cite \textit{Z. Wang} et al., J. Comput. Math. 37, No. 6, 843--865 (2019; Zbl 07266715) Full Text: DOI
Giorgi, Pascal; Grenet, Bruno; Roche, Daniel S. Generic reductions for in-place polynomial multiplication. (English) Zbl 07246246 Bradford, Russell (ed.), Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC ’19, Beijing, China, July 15–18, 2019. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6084-5). 187-194 (2019). MSC: 68W30 PDF BibTeX XML Cite \textit{P. Giorgi} et al., in: Proceedings of the 44th international symposium on symbolic and algebraic computation, ISSAC '19, Beijing, China, July 15--18, 2019. New York, NY: Association for Computing Machinery (ACM). 187--194 (2019; Zbl 07246246) Full Text: DOI
Chen, Rongjun; Tang, Guochun Two-machine flow shop scheduling with limited cost of outsourcing. (English) Zbl 1449.90096 J. Syst. Sci. Math. Sci. 39, No. 9, 1462-1470 (2019). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{R. Chen} and \textit{G. Tang}, J. Syst. Sci. Math. Sci. 39, No. 9, 1462--1470 (2019; Zbl 1449.90096)
Lin, Hao; Lin, Lan A combinatorial optimization approach for the competence set expansion problem. (English) Zbl 1449.90304 Chin. J. Eng. Math. 36, No. 5, 578-594 (2019). MSC: 90C27 90C57 90C59 PDF BibTeX XML Cite \textit{H. Lin} and \textit{L. Lin}, Chin. J. Eng. Math. 36, No. 5, 578--594 (2019; Zbl 1449.90304) Full Text: DOI
Shenmaier, V. V. An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles. (English. Russian original) Zbl 1441.05095 Proc. Steklov Inst. Math. 307, Suppl. 1, S142-S150 (2019); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 24, No. 3, 272-280 (2018). MSC: 05C20 05C22 05C38 05C85 52B11 52B05 PDF BibTeX XML Cite \textit{V. V. Shenmaier}, Proc. Steklov Inst. Math. 307, S142--S150 (2019; Zbl 1441.05095); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 24, No. 3, 272--280 (2018) Full Text: DOI
Eremeev, Anton V.; Kel’manov, Alexander V.; Kovalyov, Mikhail Y.; Pyatkin, Artem V. Maximum diversity problem with squared Euclidean distance. (English) Zbl 1446.90160 Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 541-551 (2019). MSC: 90C39 90C59 51M05 52C10 PDF BibTeX XML Cite \textit{A. V. Eremeev} et al., Lect. Notes Comput. Sci. 11548, 541--551 (2019; Zbl 1446.90160) Full Text: DOI
Kononov, Alexander; Memar, Julia; Zinder, Yakov Flow shop with job-dependent buffer requirements – a polynomial-time algorithm and efficient heuristics. (English) Zbl 1439.90035 Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 18th international conference, MOTOR 2019, Ekaterinburg, Russia, July 8–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11548, 342-357 (2019). MSC: 90B35 90C59 PDF BibTeX XML Cite \textit{A. Kononov} et al., Lect. Notes Comput. Sci. 11548, 342--357 (2019; Zbl 1439.90035) Full Text: DOI
Nip, Kameng; Wang, Zhenbo; Shi, Tianning Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 1443.90324 Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 412-424 (2019). MSC: 90C35 PDF BibTeX XML Cite \textit{K. Nip} et al., Lect. Notes Comput. Sci. 11949, 412--424 (2019; Zbl 1443.90324) Full Text: DOI
Xu, Jun; Sarkar, Santanu; Hu, Lei Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction. (English) Zbl 07199471 Hao, Feng (ed.) et al., Progress in cryptology – INDOCRYPT 2019. 20th international conference on cryptology in India, Hyderabad, India, December 15–18, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-35422-0/pbk; 978-3-030-35423-7/ebook). Lecture Notes in Computer Science 11898, 398-411 (2019). MSC: 94A60 11A05 11J70 PDF BibTeX XML Cite \textit{J. Xu} et al., Lect. Notes Comput. Sci. 11898, 398--411 (2019; Zbl 07199471) Full Text: DOI
Mou, Chenqi; Fan, Xiaolin On Berlekamp-Massey and Berlekamp-Massey-Sakata algorithms. (English) Zbl 1452.68279 England, Matthew (ed.) et al., Computer algebra in scientific computing. 21st international workshop, CASC 2019, Moscow, Russia, August 26–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11661, 362-376 (2019). MSC: 68W30 PDF BibTeX XML Cite \textit{C. Mou} and \textit{X. Fan}, Lect. Notes Comput. Sci. 11661, 362--376 (2019; Zbl 1452.68279) Full Text: DOI
Huang, Qiao-Long; Gao, Xiao-Shan Revisit sparse polynomial interpolation based on randomized Kronecker substitution. (English) Zbl 07195026 England, Matthew (ed.) et al., Computer algebra in scientific computing. 21st international workshop, CASC 2019, Moscow, Russia, August 26–30, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-26830-5/pbk; 978-3-030-26831-2/ebook). Lecture Notes in Computer Science 11661, 215-235 (2019). MSC: 65D05 65C05 68W30 PDF BibTeX XML Cite \textit{Q.-L. Huang} and \textit{X.-S. Gao}, Lect. Notes Comput. Sci. 11661, 215--235 (2019; Zbl 07195026) Full Text: DOI