van der Hoeven, Joris; Lecerf, Grégoire On the complexity exponent of polynomial system solving. (English) Zbl 07326845 Found. Comput. Math. 21, No. 1, 1-57 (2021). Reviewer: Vladimir P. Kostov (Nice) MSC: 14-04 14Q20 14B05 68W30 PDF BibTeX XML Cite \textit{J. van der Hoeven} and \textit{G. Lecerf}, Found. Comput. Math. 21, No. 1, 1--57 (2021; Zbl 07326845) Full Text: DOI
Doliskani, Javad; Narayanan, Anand Kumar; Schost, Éric Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields. (English) Zbl 07312670 J. Symb. Comput. 105, 199-213 (2021). MSC: 11G09 11Y16 68W30 11T06 PDF BibTeX XML Cite \textit{J. Doliskani} et al., J. Symb. Comput. 105, 199--213 (2021; Zbl 07312670) Full Text: DOI
Emiris, Ioannis Z.; Mantzaflaris, Angelos; Tsigaridas, Elias P. Multilinear polynomial systems: root isolation and bit complexity. (English) Zbl 07312668 J. Symb. Comput. 105, 145-164 (2021). MSC: 68Q 68W 11Y PDF BibTeX XML Cite \textit{I. Z. Emiris} et al., J. Symb. Comput. 105, 145--164 (2021; Zbl 07312668) Full Text: DOI
Henrion, Didier; Naldi, Simone; Safey El Din, Mohab Exact algorithms for semidefinite programs with degenerate feasible set. (English) Zbl 07312507 J. Symb. Comput. 104, 942-959 (2021). MSC: 90C22 68W30 90C51 90C05 90C60 13P15 14P10 PDF BibTeX XML Cite \textit{D. Henrion} et al., J. Symb. Comput. 104, 942--959 (2021; Zbl 07312507) Full Text: DOI
Hauenstein, Jon D.; Safey El Din, Mohab; Schost, Éric; Vu, Thi Xuan Solving determinantal systems using homotopy techniques. (English) Zbl 07312500 J. Symb. Comput. 104, 754-804 (2021). MSC: 13P 65H20 PDF BibTeX XML Cite \textit{J. D. Hauenstein} et al., J. Symb. Comput. 104, 754--804 (2021; Zbl 07312500) Full Text: DOI
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann Computing the multilinear factors of lacunary polynomials without heights. (English) Zbl 07312477 J. Symb. Comput. 104, 183-206 (2021). MSC: 68W30 11Y16 68Q25 11R09 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., J. Symb. Comput. 104, 183--206 (2021; Zbl 07312477) Full Text: DOI
Allamigeon, Xavier; Benchimol, Pascal; Gaubert, Stéphane; Joswig, Michael What tropical geometry tells us about the complexity of linear programming. (English) Zbl 07308560 SIAM Rev. 63, No. 1, 123-164 (2021). MSC: 90C05 90C51 90C24 14T10 PDF BibTeX XML Cite \textit{X. Allamigeon} et al., SIAM Rev. 63, No. 1, 123--164 (2021; Zbl 07308560) 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
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
Beltrán, Carlos; Etayo, Ujué; Marzo, Jordi; Ortega-Cerdà, Joaquim A sequence of polynomials with optimal condition number. (English) Zbl 07304880 J. Am. Math. Soc. 34, No. 1, 219-244 (2021). MSC: 65Y20 PDF BibTeX XML Cite \textit{C. Beltrán} et al., J. Am. Math. Soc. 34, No. 1, 219--244 (2021; Zbl 07304880) 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
Kheirfam, B.; Nasrollahi, A.; Mohammadi, M. A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood. (English) Zbl 07301291 J. Sci. Comput. 86, No. 1, Paper No. 13, 17 p. (2021). MSC: 90C22 90C51 PDF BibTeX XML Cite \textit{B. Kheirfam} et al., J. Sci. Comput. 86, No. 1, Paper No. 13, 17 p. (2021; Zbl 07301291) Full Text: DOI
Huang, Zhenyu; Sun (c), Yao; Lin, Dongdai On the efficiency of solving Boolean polynomial systems with the characteristic set method. (English) Zbl 07274355 J. Symb. Comput. 103, 66-94 (2021). MSC: 68W40 13P15 PDF BibTeX XML Cite \textit{Z. Huang} et al., J. Symb. Comput. 103, 66--94 (2021; Zbl 07274355) Full Text: DOI
Semaev, Igor; Tenti, Andrea Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases. (English) Zbl 1451.13083 J. Algebra 565, 651-674 (2021). Reviewer: Ihsen Yengui (Sfax) MSC: 13P10 PDF BibTeX XML Cite \textit{I. Semaev} and \textit{A. Tenti}, J. Algebra 565, 651--674 (2021; Zbl 1451.13083) Full Text: DOI
Krasikov, Vitaly A. Upper bounds for the analytic complexity of Puiseux polynomial solutions to bivariate hypergeometric systems. (English) Zbl 07334129 J. Sib. Fed. Univ., Math. Phys. 13, No. 6, 718-732 (2020). MSC: 26B PDF BibTeX XML Cite \textit{V. A. Krasikov}, J. Sib. Fed. Univ., Math. Phys. 13, No. 6, 718--732 (2020; Zbl 07334129) Full Text: DOI MNR
Yamakami, Tomoyuki A schematic definition of quantum polynomial time computability. (English) Zbl 07333592 J. Symb. Log. 85, No. 4, 1546-1587 (2020). MSC: 81P68 68Q12 68Q10 03D75 PDF BibTeX XML Cite \textit{T. Yamakami}, J. Symb. Log. 85, No. 4, 1546--1587 (2020; Zbl 07333592) Full Text: DOI
Sutherland, Andrew V. Counting points on superelliptic curves in average polynomial time. (English) Zbl 07319980 Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP) (ISBN 978-1-935107-07-1/print; 978-1-935107-08-8/ebook). The Open Book Series 4, 403-422 (2020). MSC: 11Y16 11G20 11M38 14G10 PDF BibTeX XML Cite \textit{A. V. Sutherland}, Open Book Ser. 4, 403--422 (2020; Zbl 07319980) Full Text: DOI
Costa, Edgar; Kedlaya, Kiran S.; Roe, David Hypergeometric \(L\)-functions in average polynomial time. (English) Zbl 07319965 Galbraith, Steven D. (ed.), ANTS XIV. Proceedings of the fourteenth algorithmic number theory symposium, Auckland, New Zealand, virtual event, June 29 – July 4, 2020. Berkeley, CA: Mathematical Sciences Publishers (MSP) (ISBN 978-1-935107-07-1/print; 978-1-935107-08-8/ebook). The Open Book Series 4, 143-159 (2020). MSC: 11Y16 33C20 11G09 11M38 11T24 PDF BibTeX XML Cite \textit{E. Costa} et al., Open Book Ser. 4, 143--159 (2020; Zbl 07319965) Full Text: DOI
Kheirfam, B.; Nasrollahi, A. A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization. (English) Zbl 07311832 Optim. Lett. 14, No. 8, 2549-2563 (2020). MSC: 90C05 90C51 PDF BibTeX XML Cite \textit{B. Kheirfam} and \textit{A. Nasrollahi}, Optim. Lett. 14, No. 8, 2549--2563 (2020; Zbl 07311832) Full Text: DOI
Darvay, Zsolt; Kheirfam, Behrouz; Rigó, Petra Renáta A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. (English) Zbl 07311786 Optim. Lett. 14, No. 7, 1747-1763 (2020). MSC: 90C05 90C51 PDF BibTeX XML Cite \textit{Z. Darvay} et al., Optim. Lett. 14, No. 7, 1747--1763 (2020; Zbl 07311786) 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
Katsamaki, Christina; Rouillier, Fabrice; Tsigaridas, Elias; Zafeirakopoulos, Zafeirakis On the geometry and the topology of parametric curves. (English) Zbl 07300082 Mantzaflaris, Angelos (ed.), Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC ’20, Kalamata, Greece, July 20–23, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7100-1). 281-288 (2020). MSC: 68W30 PDF BibTeX XML Cite \textit{C. Katsamaki} et al., in: Proceedings of the 45th international symposium on symbolic and algebraic computation, ISSAC '20, Kalamata, Greece, July 20--23, 2020. New York, NY: Association for Computing Machinery (ACM). 281--288 (2020; Zbl 07300082) Full Text: DOI
Impagliazzo, Russell; Mouli, Sasank; Pitassi, Toniann The surprising power of constant depth algebraic proofs. (English) Zbl 07299498 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). 591-603 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{R. Impagliazzo} 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). 591--603 (2020; Zbl 07299498) Full Text: DOI
Sokolov, Dmitry (Semi)algebraic proofs over \(\{\pm 1\}\) variables. (English) Zbl 07298232 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). 78-90 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Sokolov}, 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). 78--90 (2020; Zbl 07298232) Full Text: DOI
Que, Caixiong; Liu, Fuchun; Zhao, Rui; Deng, Xiuqin; Cui, Honggang Online pattern diagnosis of discrete event systems with Petri net diagnosers. (Chinese. English summary) Zbl 07295099 Control Theory Appl. 37, No. 7, 1621-1627 (2020). MSC: 94C12 93C65 PDF BibTeX XML Cite \textit{C. Que} et al., Control Theory Appl. 37, No. 7, 1621--1627 (2020; Zbl 07295099) 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
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
Aronov, Boris; Ezra, Esther; Zahl, Joshua Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications. (English) Zbl 07282216 SIAM J. Comput. 49, No. 6, 1109-1127 (2020). MSC: 68W05 68R05 52C45 52C30 PDF BibTeX XML Cite \textit{B. Aronov} et al., SIAM J. Comput. 49, No. 6, 1109--1127 (2020; Zbl 07282216) Full Text: DOI
Jia, Zeyu; Wen, Zaiwen; Ye, Yinyu Towards solving 2-TBSG efficiently. (English) Zbl 1454.91021 Optim. Methods Softw. 35, No. 4, 706-721 (2020). MSC: 91A15 91A05 90C40 91A68 PDF BibTeX XML Cite \textit{Z. Jia} et al., Optim. Methods Softw. 35, No. 4, 706--721 (2020; Zbl 1454.91021) Full Text: DOI
Kheirfam, Behrouz A second-order corrector infeasible interior-point method with one-norm wide neighborhood for symmetric optimization. (English) Zbl 07271742 Fundam. Inform. 172, No. 4, 343-359 (2020). MSC: 68 PDF BibTeX XML Cite \textit{B. Kheirfam}, Fundam. Inform. 172, No. 4, 343--359 (2020; Zbl 07271742) 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
Yang, Bo; Du, Tianqi; Xiao, Zibi Linear complexity of generalized cyclotomic binary sequences of period \(pq\). (English) Zbl 07266901 J. Math., Wuhan Univ. 40, No. 2, 139-148 (2020). MSC: 11T22 11T55 94A55 94A60 PDF BibTeX XML Cite \textit{B. Yang} et al., J. Math., Wuhan Univ. 40, No. 2, 139--148 (2020; Zbl 07266901) Full Text: DOI
Evtushenko, Yu. G.; Tret’yakov, A. A. Locally polynomial method for solving systems of linear inequalities. (English. Russian original) Zbl 1450.65041 Comput. Math. Math. Phys. 60, No. 2, 222-226 (2020); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 2, 216-220 (2020). MSC: 65F99 15A39 PDF BibTeX XML Cite \textit{Yu. G. Evtushenko} and \textit{A. A. Tret'yakov}, Comput. Math. Math. Phys. 60, No. 2, 222--226 (2020; Zbl 1450.65041); translation from Zh. Vychisl. Mat. Mat. Fiz. 60, No. 2, 216--220 (2020) Full Text: DOI
Shpilka, Amir Sylvester-Gallai type theorems for quadratic polynomials. (English) Zbl 1456.68039 Discrete Anal. 2020, Paper No. 13, 34 p. (2020). MSC: 68Q06 52C10 68U05 68W20 68W30 PDF BibTeX XML Cite \textit{A. Shpilka}, Discrete Anal. 2020, Paper No. 13, 34 p. (2020; Zbl 1456.68039) Full Text: DOI arXiv
Gemsa, Andreas; Niedermann, Benjamin; Nöllenburg, Martin A unified model and algorithms for temporal map labeling. (English) Zbl 07259192 Algorithmica 82, No. 10, 2709-2736 (2020). MSC: 68U05 68Q17 68W25 PDF BibTeX XML Cite \textit{A. Gemsa} et al., Algorithmica 82, No. 10, 2709--2736 (2020; Zbl 07259192) 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
Chistov, A. L. Systems with parameters, or efficiently solving systems of polynomial equations: 33 years later. III. (English. Russian original) Zbl 1448.13048 J. Math. Sci., New York 247, No. 5, 738-757 (2020); translation from Zap. Nauchn. Semin. POMI 481, 146-177 (2019). MSC: 13P15 13-03 01A60 01A61 12-08 14Q20 68W30 PDF BibTeX XML Cite \textit{A. L. Chistov}, J. Math. Sci., New York 247, No. 5, 738--757 (2020; Zbl 1448.13048); translation from Zap. Nauchn. Semin. POMI 481, 146--177 (2019) Full Text: DOI
Darvay, Zs.; Illés, T.; Kheirfam, B.; Rigó, P. R. A corrector-predictor interior-point method with new search direction for linear optimization. (English) Zbl 07252401 CEJOR, Cent. Eur. J. Oper. Res. 28, No. 3, 1123-1140 (2020). MSC: 90B 90C05 90C51 PDF BibTeX XML Cite \textit{Zs. Darvay} et al., CEJOR, Cent. Eur. J. Oper. Res. 28, No. 3, 1123--1140 (2020; Zbl 07252401) Full Text: DOI
Fernau, Henning; Fluschnik, Till; Hermelin, Danny; Krebs, Andreas; Molter, Hendrik; Niedermeier, Rolf Diminishable parameterized problems and strict polynomial kernelization. (English) Zbl 07244820 Computability 9, No. 1, 1-24 (2020). MSC: 03D PDF BibTeX XML Cite \textit{H. Fernau} et al., Computability 9, No. 1, 1--24 (2020; Zbl 07244820) 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 1456.68124 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 1456.68124) Full Text: DOI
Grigoriev, Dima; Podolskii, Vladimir V. Tropical combinatorial Nullstellensatz and sparse polynomials. (English) Zbl 1455.14126 Found. Comput. Math. 20, No. 4, 753-781 (2020). MSC: 14T10 68W30 68R05 68Q25 14Q20 PDF BibTeX XML Cite \textit{D. Grigoriev} and \textit{V. V. Podolskii}, Found. Comput. Math. 20, No. 4, 753--781 (2020; Zbl 1455.14126) Full Text: DOI
Gritzmann, Peter; Langfeld, Barbara On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity. (English) Zbl 1453.68114 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 1453.68114) Full Text: DOI
Bishoi, Susil Kumar; Senapati, Kedarnath; Shankar, B. R. Shrinking generators based on \(\sigma \)-LFSRs. (English) Zbl 1453.94051 Discrete Appl. Math. 285, 493-500 (2020). MSC: 94A55 94A60 PDF BibTeX XML Cite \textit{S. K. Bishoi} et al., Discrete Appl. Math. 285, 493--500 (2020; Zbl 1453.94051) 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
Kheirfam, Behrouz; Haghighi, Masoumeh A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps. (English) Zbl 1448.90059 Numer. Algorithms 85, No. 1, 59-75 (2020). MSC: 90C05 90C51 PDF BibTeX XML Cite \textit{B. Kheirfam} and \textit{M. Haghighi}, Numer. Algorithms 85, No. 1, 59--75 (2020; Zbl 1448.90059) Full Text: DOI
Araújo, Júlio; Campos, Victor A.; Lima, Carlos Vinícius G. C.; dos Santos, Vinícius Fernandes; Sau, Ignasi; Silva, Ana Dual parameterization of weighted coloring. (English) Zbl 1452.68129 Algorithmica 82, No. 8, 2316-2336 (2020). MSC: 68R10 05C15 68Q27 68W40 PDF BibTeX XML Cite \textit{J. Araújo} et al., Algorithmica 82, No. 8, 2316--2336 (2020; Zbl 1452.68129) Full Text: DOI
Cohen, Albert; Dahmen, Wolfgang; Devore, Ronald; Nichols, James Reduced basis greedy selection using random training sets. (English) Zbl 1444.62113 ESAIM, Math. Model. Numer. Anal. 54, No. 5, 1509-1524 (2020). MSC: 62M45 65D05 65Y20 68Q32 68Q30 35B30 41A25 58D15 PDF BibTeX XML Cite \textit{A. Cohen} et al., ESAIM, Math. Model. Numer. Anal. 54, No. 5, 1509--1524 (2020; Zbl 1444.62113) Full Text: DOI
Grigoryan, Hayk A.; Shoukourian, Samvel K. Polynomial algorithm for equivalence problem of deterministic multitape finite automata. (English) Zbl 1451.68149 Theor. Comput. Sci. 833, 120-132 (2020). MSC: 68Q45 68Q25 PDF BibTeX XML Cite \textit{H. A. Grigoryan} and \textit{S. K. Shoukourian}, Theor. Comput. Sci. 833, 120--132 (2020; Zbl 1451.68149) Full Text: DOI
Selezneva, Svetlana N. On weak positive predicates over a finite set. (English. Russian original) Zbl 1445.68142 Discrete Math. Appl. 30, No. 3, 203-213 (2020); translation from Diskretn. Mat. 30, No. 3, 127-140 (2018). MSC: 68R07 03B70 68Q25 68W40 PDF BibTeX XML Cite \textit{S. N. Selezneva}, Discrete Math. Appl. 30, No. 3, 203--213 (2020; Zbl 1445.68142); translation from Diskretn. Mat. 30, No. 3, 127--140 (2018) Full Text: DOI
Hoang, Duc A.; Suzuki, Akira; Yagita, Tsuyoshi Reconfiguring \(k\)-path vertex covers. (English) Zbl 07224279 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-39880-4/pbk; 978-3-030-39881-1/ebook). Lecture Notes in Computer Science 12049, 133-145 (2020). MSC: 68Wxx PDF BibTeX XML Cite \textit{D. A. Hoang} et al., Lect. Notes Comput. Sci. 12049, 133--145 (2020; Zbl 07224279) 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
Bostan, A.; Krick, T.; Szanto, A.; Valdettaro, M. Subresultants of \((x-\alpha)^m\) and \((x-\beta)^n\), Jacobi polynomials and complexity. (English) Zbl 1446.13023 J. Symb. Comput. 101, 330-351 (2020). MSC: 13P15 15B05 33C05 33C45 33F10 68W30 PDF BibTeX XML Cite \textit{A. Bostan} et al., J. Symb. Comput. 101, 330--351 (2020; Zbl 1446.13023) Full Text: DOI
Emiris, Ioannis; Mourrain, Bernard; Tsigaridas, Elias Separation bounds for polynomial systems. (English) Zbl 1446.68202 J. Symb. Comput. 101, 128-151 (2020). MSC: 68W30 12D10 13P15 65H04 68Q25 PDF BibTeX XML Cite \textit{I. Emiris} et al., J. Symb. Comput. 101, 128--151 (2020; Zbl 1446.68202) Full Text: DOI
Faria, Luerbio; Klein, Sulamita; Sau, Ignasi; Souza, Uéverton S.; Sucupira, Rubens Maximum cuts in edge-colored graphs. (English) Zbl 1440.05085 Discrete Appl. Math. 281, 229-234 (2020). MSC: 05C15 05C35 05C10 68Q17 PDF BibTeX XML Cite \textit{L. Faria} et al., Discrete Appl. Math. 281, 229--234 (2020; Zbl 1440.05085) Full Text: DOI
Barth, Dominik; Beck, Moritz; Dose, Titus; Glaßer, Christian; Michler, Larissa; Technau, Marc Emptiness problems for integer circuits. (English) Zbl 1441.68063 Theor. Comput. Sci. 824-825, 11-35 (2020). MSC: 68Q17 68Q06 PDF BibTeX XML Cite \textit{D. Barth} et al., Theor. Comput. Sci. 824--825, 11--35 (2020; Zbl 1441.68063) Full Text: DOI
Döcker, Janosch; Dorn, Britta; Linz, Simone; Semple, Charles Placing quantified variants of 3-SAT and not-all-equal 3-SAT in the polynomial hierarchy. (English) Zbl 1440.68114 Theor. Comput. Sci. 822, 72-91 (2020). MSC: 68Q25 03B70 68Q17 68R07 PDF BibTeX XML Cite \textit{J. Döcker} et al., Theor. Comput. Sci. 822, 72--91 (2020; Zbl 1440.68114) Full Text: DOI
Zhang, Liyu; Quweider, Mahmoud; Lei, Hansheng; Khan, Fitra Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets. (English) Zbl 07203023 Theor. Comput. Sci. 822, 36-48 (2020). MSC: 03D15 PDF BibTeX XML Cite \textit{L. Zhang} et al., Theor. Comput. Sci. 822, 36--48 (2020; Zbl 07203023) Full Text: DOI
Emelyanov, Pavel; Ponomaryov, Denis The complexity of AND-decomposition of Boolean functions. (English) Zbl 07201709 Discrete Appl. Math. 280, 113-132 (2020). MSC: 06E30 PDF BibTeX XML Cite \textit{P. Emelyanov} and \textit{D. Ponomaryov}, Discrete Appl. Math. 280, 113--132 (2020; Zbl 07201709) Full Text: DOI
Pirhaji, Mohammad; Zangiabadi, Maryam; Mansouri, Hossien; Nakhaei, Ali; Shojaeifard, Ali A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization. (English) Zbl 1449.90281 J. Oper. Res. Soc. China 8, No. 1, 145-164 (2020). MSC: 90C22 90C25 90C51 PDF BibTeX XML Cite \textit{M. Pirhaji} et al., J. Oper. Res. Soc. China 8, No. 1, 145--164 (2020; Zbl 1449.90281) Full Text: DOI
de Klerk, Etienne; Laurent, Monique Worst-case examples for Lasserre’s measure-based hierarchy for polynomial optimization on the hypercube. (English) Zbl 1442.90141 Math. Oper. Res. 45, No. 1, 86-98 (2020). MSC: 90C23 90C22 90C26 90C30 90C60 90C56 PDF BibTeX XML Cite \textit{E. de Klerk} and \textit{M. Laurent}, Math. Oper. Res. 45, No. 1, 86--98 (2020; Zbl 1442.90141) 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
Henrion, Didier; Naldi, Simone; Safey El Din, Mohab Real root finding for low rank linear matrices. (English) Zbl 1445.13026 Appl. Algebra Eng. Commun. Comput. 31, No. 2, 101-133 (2020). Reviewer: Sonia Pérez Díaz (Madrid) MSC: 13P15 14Q20 14Q30 68W30 PDF BibTeX XML Cite \textit{D. Henrion} et al., Appl. Algebra Eng. Commun. Comput. 31, No. 2, 101--133 (2020; Zbl 1445.13026) 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
Enayat, Ali; Łełyk, Mateusz; Wcisło, Bartosz Truth and feasible reducibility. (English) Zbl 1444.03164 J. Symb. Log. 85, No. 1, 367-421 (2020). Reviewer: Victor V. Pambuccian (Glendale) MSC: 03F30 03C62 03D15 03H15 PDF BibTeX XML Cite \textit{A. Enayat} et al., J. Symb. Log. 85, No. 1, 367--421 (2020; Zbl 1444.03164) 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
Li, Qian; Sun, Xiaoming On the modulo degree complexity of Boolean functions. (English) Zbl 1433.68175 Theor. Comput. Sci. 818, 32-40 (2020). MSC: 68Q25 06E30 68R10 PDF BibTeX XML Cite \textit{Q. Li} and \textit{X. Sun}, Theor. Comput. Sci. 818, 32--40 (2020; Zbl 1433.68175) Full Text: DOI
Beltrán, Carlos; Kozhasov, Khazhgali The real polynomial eigenvalue problem is well conditioned on the average. (English) Zbl 07184254 Found. Comput. Math. 20, No. 2, 291-309 (2020). MSC: 14Q20 15A18 15A22 15B52 65F15 PDF BibTeX XML Cite \textit{C. Beltrán} and \textit{K. Kozhasov}, Found. Comput. Math. 20, No. 2, 291--309 (2020; Zbl 07184254) Full Text: DOI
Garg, Ankit; Gurvits, Leonid; Oliveira, Rafael; Wigderson, Avi Operator scaling: theory and applications. (English) Zbl 1432.68617 Found. Comput. Math. 20, No. 2, 223-290 (2020). MSC: 68W40 15A09 15A27 68Q25 68W20 68W25 68W30 81P68 PDF BibTeX XML Cite \textit{A. Garg} et al., Found. Comput. Math. 20, No. 2, 223--290 (2020; Zbl 1432.68617) 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
Przybyłek, Michał R.; Siedlecki, Paweł A note on the complexity of a phaseless polynomial interpolation. (English) Zbl 07181485 J. Complexity 58, Article ID 101456, 13 p. (2020). MSC: 65D05 41A05 41A10 65Y20 PDF BibTeX XML Cite \textit{M. R. Przybyłek} and \textit{P. Siedlecki}, J. Complexity 58, Article ID 101456, 13 p. (2020; Zbl 07181485) 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
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan Solving partition problems almost always requires pushing many vertices around. (English) Zbl 1434.05123 SIAM J. Discrete Math. 34, No. 1, 640-681 (2020). MSC: 05C70 05C85 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{I. Kanj} et al., SIAM J. Discrete Math. 34, No. 1, 640--681 (2020; Zbl 1434.05123) 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
Freitag, James; Sánchez, Omar León; Li, Wei Effective definability of Kolchin polynomials. (English) Zbl 07176134 Proc. Am. Math. Soc. 148, No. 4, 1455-1466 (2020). MSC: 12H05 14Q20 PDF BibTeX XML Cite \textit{J. Freitag} et al., Proc. Am. Math. Soc. 148, No. 4, 1455--1466 (2020; Zbl 07176134) Full Text: DOI
Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav Quadratic vertex kernel for rainbow matching. (English) Zbl 1435.68236 Algorithmica 82, No. 4, 881-897 (2020). MSC: 68R10 05C15 05C70 05C85 68Q27 PDF BibTeX XML Cite \textit{S. Gupta} et al., Algorithmica 82, No. 4, 881--897 (2020; Zbl 1435.68236) 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
De Loera, Jesús A.; Haddock, Jamie; Rademacher, Luis The minimum Euclidean-norm point in a convex polytope: Wolfe’s combinatorial algorithm is exponential. (English) Zbl 1453.90113 SIAM J. Comput. 49, No. 1, 138-169 (2020). Reviewer: Uma Kant Sahoo (Kolkata) MSC: 90C20 90C25 90C60 PDF BibTeX XML Cite \textit{J. A. De Loera} et al., SIAM J. Comput. 49, No. 1, 138--169 (2020; Zbl 1453.90113) Full Text: DOI
Khachay, Michael; Neznakhina, Katherine Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. (English) Zbl 1430.90491 Ann. Math. Artif. Intell. 88, No. 1-3, 53-69 (2020). MSC: 90C27 90C35 90C60 PDF BibTeX XML Cite \textit{M. Khachay} and \textit{K. Neznakhina}, Ann. Math. Artif. Intell. 88, No. 1--3, 53--69 (2020; Zbl 1430.90491) Full Text: DOI
Kheirfam, Behrouz; Nasrollahi, Afsaneh An extension for identifying search directions for interior-point methods in linear optimization. (English) Zbl 1430.90559 Asian-Eur. J. Math. 13, No. 1, Article ID 2050014, 12 p. (2020). MSC: 90C51 PDF BibTeX XML Cite \textit{B. Kheirfam} and \textit{A. Nasrollahi}, Asian-Eur. J. Math. 13, No. 1, Article ID 2050014, 12 p. (2020; Zbl 1430.90559) Full Text: DOI
Oudghiri, Soufiane Drissi; Hachimi, Mohamed On the complexity of the assignment problem with ordinal data. (English) Zbl 1430.90497 Int. J. Math. Comput. Sci. 15, No. 1, 155-181 (2020). MSC: 90C27 PDF BibTeX XML Cite \textit{S. D. Oudghiri} and \textit{M. Hachimi}, Int. J. Math. Comput. Sci. 15, No. 1, 155--181 (2020; Zbl 1430.90497) Full Text: Link
Liu, Xiao; Xi, Yuanzhe; Saad, Yousef; de Hoop, Maarten V. Solving the three-dimensional high-frequency Helmholtz equation using contour integration and polynomial preconditioning. (English) Zbl 1434.65234 SIAM J. Matrix Anal. Appl. 41, No. 1, 58-82 (2020). MSC: 65N22 15A06 65F08 65F10 65Y20 PDF BibTeX XML Cite \textit{X. Liu} et al., SIAM J. Matrix Anal. Appl. 41, No. 1, 58--82 (2020; Zbl 1434.65234) 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
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
Hudry, Olivier; Lobstein, Antoine Complexity of unique (optimal) solutions in graphs: vertex cover and domination. (English) Zbl 07274190 J. Comb. Math. Comb. Comput. 110, 217-240 (2019). MSC: 68 90 PDF BibTeX XML Cite \textit{O. Hudry} and \textit{A. Lobstein}, J. Comb. Math. Comb. Comput. 110, 217--240 (2019; Zbl 07274190)
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
Paouris, Grigoris; Phillipson, Kaitlyn; Rojas, J. Maurice A faster solution to Smale’s 17th problem. I: Real binomial systems. (English) Zbl 07246263 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). 323-330 (2019). MSC: 68W30 PDF BibTeX XML Cite \textit{G. Paouris} 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). 323--330 (2019; Zbl 07246263) Full Text: DOI
Beyersdorff, Olaf; Chew, Leroy; Clymo, Judith; Mahajan, Meena Short proofs in QBF expansion. (English) Zbl 1441.68085 Janota, Mikoláš (ed.) et al., Theory and applications of satisfiability testing – SAT 2019. 22nd international conference, SAT 2019, Lisbon, Portugal, July 9–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11628, 19-35 (2019). MSC: 68Q25 03F20 68R07 68T20 PDF BibTeX XML Cite \textit{O. Beyersdorff} et al., Lect. Notes Comput. Sci. 11628, 19--35 (2019; Zbl 1441.68085) Full Text: DOI
Golovachev, Mikhail; Pyatkin, Artem V. Routing open shop with two nodes, unit processing times and equal number of jobs and machines. (English) Zbl 1439.90033 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, 264-276 (2019). MSC: 90B35 90C35 PDF BibTeX XML Cite \textit{M. Golovachev} and \textit{A. V. Pyatkin}, Lect. Notes Comput. Sci. 11548, 264--276 (2019; Zbl 1439.90033) 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
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
Krasikov, V. A. Analytic complexity of hypergeometric functions satisfying systems with holonomic rank two. (English) Zbl 1437.33023 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, 330-342 (2019). MSC: 33F05 33C05 33C20 PDF BibTeX XML Cite \textit{V. A. Krasikov}, Lect. Notes Comput. Sci. 11661, 330--342 (2019; Zbl 1437.33023) Full Text: DOI
Mustafa, Nabil H.; Ray, Saurabh On a problem of Danzer. (English) Zbl 1436.52020 Comb. Probab. Comput. 28, No. 3, 473-482 (2019). MSC: 52C45 PDF BibTeX XML Cite \textit{N. H. Mustafa} and \textit{S. Ray}, Comb. Probab. Comput. 28, No. 3, 473--482 (2019; Zbl 1436.52020) Full Text: DOI
Chistov, A. L. Systems with parameters, or efficiently solving systems of polynomial equations 33 years later. II. (English. Russian original) Zbl 1445.13025 J. Math. Sci., New York 240, No. 5, 594-616 (2019); translation from Zap. Nauchn. Semin. POMI 468, 138-176 (2018). MSC: 13P15 13-03 01A60 01A61 12-08 14Q20 PDF BibTeX XML Cite \textit{A. L. Chistov}, J. Math. Sci., New York 240, No. 5, 594--616 (2019; Zbl 1445.13025); translation from Zap. Nauchn. Semin. POMI 468, 138--176 (2018) Full Text: DOI
Guo, Zeyu; Saxena, Nitin; Sinhababu, Amit Algebraic dependencies and \(\mathsf{PSPACE}\) algorithms in approximative complexity over any field. (English) Zbl 1456.68058 Theory Comput. 15, Paper No. 16, 30 p. (2019). MSC: 68Q25 11T06 14Q20 68W30 PDF BibTeX XML Cite \textit{Z. Guo} et al., Theory Comput. 15, Paper No. 16, 30 p. (2019; Zbl 1456.68058) Full Text: DOI
Shpilka, Amir Sylvester-Gallai type theorems for quadratic polynomials. (English) Zbl 1434.68162 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). 1203-1214 (2019). MSC: 68Q06 68U05 68W20 68W30 PDF BibTeX XML Cite \textit{A. Shpilka}, 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). 1203--1214 (2019; Zbl 1434.68162) Full Text: DOI
Bringmann, Karl; Künnemann, Marvin; Węgrzycki, Karol Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. (English) Zbl 1433.68611 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). 943-954 (2019). MSC: 68W25 68Q17 68R10 68W40 PDF BibTeX XML Cite \textit{K. Bringmann} 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). 943--954 (2019; Zbl 1433.68611) Full Text: DOI
Brakensiek, Joshua; Gopi, Sivakanth; Guruswami, Venkatesan CSPs with global modular constraints: algorithms and hardness via polynomial representations. (English) Zbl 1433.68270 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). 590-601 (2019). MSC: 68R07 68Q17 68Q25 68W40 PDF BibTeX XML Cite \textit{J. Brakensiek} 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). 590--601 (2019; Zbl 1433.68270) 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
Wang, Yadan; Liu, Hongwei; Liu, Zexian A modified full-NT-step infeasible interior-point algorithm for SDP based on a specific kernel function. (English) Zbl 1449.90283 J. Harbin Inst. Technol. (N.S.) 26, No. 2, 41-47 (2019). MSC: 90C22 90C51 PDF BibTeX XML Cite \textit{Y. Wang} et al., J. Harbin Inst. Technol. (N.S.) 26, No. 2, 41--47 (2019; Zbl 1449.90283) Full Text: DOI