Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasi-polynomial time. (English) Zbl 07516621 SIAM J. Comput. 51, No. 2, STOC17-152-STOC17-188 (2022). MSC: 68Q25 68Q70 PDF BibTeX XML Cite \textit{C. S. Calude} et al., SIAM J. Comput. 51, No. 2, STOC17--152-STOC17--188 (2022; Zbl 07516621) Full Text: DOI OpenURL
Hou, Liangshao; Qian, Xun; Liao, Li-Zhi; Sun, Jie An interior point parameterized central path following algorithm for linearly constrained convex programming. (English) Zbl 07488708 J. Sci. Comput. 90, No. 3, Paper No. 95, 31 p. (2022). MSC: 90C25 90C30 90C51 90C60 PDF BibTeX XML Cite \textit{L. Hou} et al., J. Sci. Comput. 90, No. 3, Paper No. 95, 31 p. (2022; Zbl 07488708) Full Text: DOI OpenURL
Nip, Kameng; Shi, Tianning; Wang, Zhenbo Some graph optimization problems with weights satisfying linear constraints. (English) Zbl 07473269 J. Comb. Optim. 43, No. 1, 200-225 (2022). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{K. Nip} et al., J. Comb. Optim. 43, No. 1, 200--225 (2022; Zbl 07473269) Full Text: DOI OpenURL
Besner, Manfred Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations. (English) Zbl 1480.91018 Discrete Appl. Math. 309, 85-109 (2022). MSC: 91A12 91A68 PDF BibTeX XML Cite \textit{M. Besner}, Discrete Appl. Math. 309, 85--109 (2022; Zbl 1480.91018) Full Text: DOI OpenURL
Pardo, Luis M.; Sebastián, Daniel A promenade through correct test sequences. I: Degree of constructible sets, Bézout’s inequality and density. (English) Zbl 1482.68280 J. Complexity 68, Article ID 101588, 92 p. (2022). Reviewer: Amir Hashemi (Isfahan) MSC: 68W30 12E05 13F20 13P15 14Q20 68Q25 68W20 68W40 PDF BibTeX XML Cite \textit{L. M. Pardo} and \textit{D. Sebastián}, J. Complexity 68, Article ID 101588, 92 p. (2022; Zbl 1482.68280) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI OpenURL
Frei, Fabian; Hemaspaandra, Edith; Rothe, Jörg Complexity of stability. (English) Zbl 1472.68113 J. Comput. Syst. Sci. 123, 103-121 (2022). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{F. Frei} et al., J. Comput. Syst. Sci. 123, 103--121 (2022; Zbl 1472.68113) Full Text: DOI arXiv OpenURL
Selivanova, Svetlana; Steinberg, Florian; Thies, Holger; Ziegler, Martin Exact real computation of solution operators for linear analytic systems of partial differential equations. (English) Zbl 07497965 Boulier, François (ed.) et al., Computer algebra in scientific computing. 23rd international workshop, CASC 2021, Sochi, Russia, September 13–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12865, 370-390 (2021). MSC: 68W30 PDF BibTeX XML Cite \textit{S. Selivanova} et al., Lect. Notes Comput. Sci. 12865, 370--390 (2021; Zbl 07497965) Full Text: DOI OpenURL
Granger, Robert; Joux, Antoine Computing discrete logarithms. (English) Zbl 1483.94042 Bos, Joppe W. (ed.) et al., Computational cryptography. Algorithmic aspects of cryptology. A tribute to Arjen K. Lenstra on the occasion of his 65th birthday. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 469, 106-139 (2021). MSC: 94A60 94-03 94-02 68Q12 PDF BibTeX XML Cite \textit{R. Granger} and \textit{A. Joux}, Lond. Math. Soc. Lect. Note Ser. 469, 106--139 (2021; Zbl 1483.94042) Full Text: Link OpenURL
Reynoso, Alejandro; Vakhania, Nodari Theoretical and practical issues in single-machine scheduling with two job release and delivery times. (English) Zbl 1480.90142 J. Sched. 24, No. 6, 615-647 (2021). MSC: 90B35 68M20 PDF BibTeX XML Cite \textit{A. Reynoso} and \textit{N. Vakhania}, J. Sched. 24, No. 6, 615--647 (2021; Zbl 1480.90142) Full Text: DOI OpenURL
Pradhan, D.; Pal, Saikat An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph. (English) Zbl 1475.05139 J. Appl. Math. Comput. 66, No. 1-2, 733-747 (2021). MSC: 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Pradhan} and \textit{S. Pal}, J. Appl. Math. Comput. 66, No. 1--2, 733--747 (2021; Zbl 1475.05139) Full Text: DOI OpenURL
Naresh Kumar, H.; Pradhan, D.; Venkatakrishnan, Y. B. Double vertex-edge domination in graphs: complexity and algorithms. (English) Zbl 1475.05134 J. Appl. Math. Comput. 66, No. 1-2, 245-262 (2021). MSC: 05C69 68Q25 68Q17 PDF BibTeX XML Cite \textit{H. Naresh Kumar} et al., J. Appl. Math. Comput. 66, No. 1--2, 245--262 (2021; Zbl 1475.05134) Full Text: DOI OpenURL
Zinder, Yakov; Kononov, Alexandr; Fung, Joey A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements. (English) Zbl 1478.90046 J. Comb. Optim. 42, No. 2, 276-309 (2021). MSC: 90B35 PDF BibTeX XML Cite \textit{Y. Zinder} et al., J. Comb. Optim. 42, No. 2, 276--309 (2021; Zbl 1478.90046) Full Text: DOI OpenURL
Cucker, Felipe Smale’s 17th problem: advances and open directions. (English) Zbl 07402068 N. Z. J. Math. 52, 233-257 (2021). MSC: 65H20 65Y20 14-XX 68W30 PDF BibTeX XML Cite \textit{F. Cucker}, N. Z. J. Math. 52, 233--257 (2021; Zbl 07402068) Full Text: DOI OpenURL
Bravyi, Sergey; Maslov, Dmitri Hadamard-free circuits expose the structure of the Clifford group. (English) Zbl 1475.68132 IEEE Trans. Inf. Theory 67, No. 7, 4546-4563 (2021). MSC: 68Q12 81P68 81R05 PDF BibTeX XML Cite \textit{S. Bravyi} and \textit{D. Maslov}, IEEE Trans. Inf. Theory 67, No. 7, 4546--4563 (2021; Zbl 1475.68132) Full Text: DOI arXiv OpenURL
Adsul, Bharat; Garg, Jugal; Mehta, Ruta; Sohoni, Milind; von Stengel, Bernhard Fast algorithms for rank-1 bimatrix games. (English) Zbl 1470.91066 Oper. Res. 69, No. 2, 613-631 (2021). MSC: 91A68 91A05 91A10 PDF BibTeX XML Cite \textit{B. Adsul} et al., Oper. Res. 69, No. 2, 613--631 (2021; Zbl 1470.91066) Full Text: DOI arXiv OpenURL
Chattopadhyay, Arkadev; Grenet, Bruno; Koiran, Pascal; Portier, Natacha; Strozecki, Yann Computing the multilinear factors of lacunary polynomials without heights. (English) Zbl 1481.11105 J. Symb. Comput. 104, 183-206 (2021). Reviewer: Amir Hashemi (Isfahan) MSC: 11R09 11Y05 11Y16 PDF BibTeX XML Cite \textit{A. Chattopadhyay} et al., J. Symb. Comput. 104, 183--206 (2021; Zbl 1481.11105) Full Text: DOI arXiv OpenURL
Chiarelli, Nina; Martínez-Barona, Berenice; Milanič, Martin; Monnot, Jérôme; Muršič, Peter Strong cliques in diamond-free graphs. (English) Zbl 1458.05189 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 1458.05189) Full Text: DOI arXiv OpenURL
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos On the fast delivery problem with one or two packages. (English) Zbl 1464.68278 J. Comput. Syst. Sci. 115, 246-263 (2021). MSC: 68R10 68Q25 68T40 90B06 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., J. Comput. Syst. Sci. 115, 246--263 (2021; Zbl 1464.68278) Full Text: DOI OpenURL
Runge, Vincent Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces? (English) Zbl 1462.52032 J. Optim. Theory Appl. 187, No. 2, 431-447 (2020). MSC: 52C17 90C26 68U05 62L10 PDF BibTeX XML Cite \textit{V. Runge}, J. Optim. Theory Appl. 187, No. 2, 431--447 (2020; Zbl 1462.52032) Full Text: DOI arXiv OpenURL
Yamakami, Tomoyuki A schematic definition of quantum polynomial time computability. (English) Zbl 1461.81020 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 1461.81020) Full Text: DOI arXiv OpenURL
Sutherland, Andrew V. Counting points on superelliptic curves in average polynomial time. (English) Zbl 1472.11322 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). Open Book Ser. 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 1472.11322) Full Text: DOI arXiv OpenURL
Costa, Edgar; Kedlaya, Kiran S.; Roe, David Hypergeometric \(L\)-functions in average polynomial time. (English) Zbl 1472.11316 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). Open Book Ser. 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 1472.11316) Full Text: DOI arXiv OpenURL
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 arXiv OpenURL
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 OpenURL
Gemsa, Andreas; Niedermann, Benjamin; Nöllenburg, Martin A unified model and algorithms for temporal map labeling. (English) Zbl 1460.68123 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 1460.68123) Full Text: DOI OpenURL
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: 68Q27 68Q17 PDF BibTeX XML Cite \textit{H. Fernau} et al., Computability 9, No. 1, 1--24 (2020; Zbl 07244820) Full Text: DOI OpenURL
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 arXiv Link OpenURL
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 OpenURL
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: 20G40 20-08 68Q25 PDF BibTeX XML Cite \textit{D. Holt} et al., J. Algebra 561, 215--236 (2020; Zbl 07239066) Full Text: DOI OpenURL
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 OpenURL
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. Lect. Notes Comput. Sci. 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 arXiv OpenURL
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: 20B05 20B25 20-08 68Q25 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 arXiv OpenURL
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 arXiv OpenURL
Zhang, Liyu; Quweider, Mahmoud; Lei, Hansheng; Khan, Fitra Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets. (English) Zbl 1462.03017 Theor. Comput. Sci. 822, 36-48 (2020). Reviewer: Guillermo Morales Luna (Ciudad de México) MSC: 03D15 PDF BibTeX XML Cite \textit{L. Zhang} et al., Theor. Comput. Sci. 822, 36--48 (2020; Zbl 1462.03017) Full Text: DOI OpenURL
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 arXiv OpenURL
Laurent, Olivier Polynomial time in untyped elementary linear logic. (English) Zbl 1481.03067 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 1481.03067) Full Text: DOI HAL OpenURL
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 Link OpenURL
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 20D15 20K01 68Q25 20F70 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 OpenURL
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 Link OpenURL
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 OpenURL
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 OpenURL
Lozin, Vadim; Malyshev, Dmitriy; Mosca, Raffaele; Zamaraev, Viktor Independent domination versus weighted independent domination. (English) Zbl 1478.68250 Inf. Process. Lett. 156, Article ID 105914, 5 p. (2020). MSC: 68R10 05C69 05C85 68Q17 68Q25 PDF BibTeX XML Cite \textit{V. Lozin} et al., Inf. Process. Lett. 156, Article ID 105914, 5 p. (2020; Zbl 1478.68250) Full Text: DOI OpenURL
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 arXiv OpenURL
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 OpenURL
Papadopoulos, Charis; Tzimas, Spyridon Subset feedback vertex set on graphs of bounded independent set size. (English) Zbl 07378606 Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 20, 14 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{C. Papadopoulos} and \textit{S. Tzimas}, LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 20, 14 p. (2019; Zbl 07378606) Full Text: DOI arXiv OpenURL
Borisovsky, Pavel; Eremeev, Anton; Hrushev, Sergei; Teplyakov, Vadim; Vorozhtsov, Mikhail On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths. (English) Zbl 1474.65162 Yugosl. J. Oper. Res. 29, No. 1, 93-112 (2019). MSC: 65K05 68Q25 68W25 90B10 90C05 PDF BibTeX XML Cite \textit{P. Borisovsky} et al., Yugosl. J. Oper. Res. 29, No. 1, 93--112 (2019; Zbl 1474.65162) Full Text: DOI OpenURL
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 OpenURL
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 OpenURL
Carvalho, Iago A.; Erlebach, Thomas; Papadopoulos, Kleitos An efficient algorithm for the fast delivery problem. (English) Zbl 1464.68277 Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 171-184 (2019). MSC: 68R10 68Q25 68T40 90B06 PDF BibTeX XML Cite \textit{I. A. Carvalho} et al., Lect. Notes Comput. Sci. 11651, 171--184 (2019; Zbl 1464.68277) Full Text: DOI arXiv OpenURL
Kel’manov, A. V.; Khandeev, V. I. Polynomial-time solvability of the one-dimensional case of an NP-hard clustering problem. (English. Russian original) Zbl 07150939 Comput. Math. Math. Phys. 59, No. 9, 1553-1561 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617-1625 (2019). MSC: 68Q25 90C20 PDF BibTeX XML Cite \textit{A. V. Kel'manov} and \textit{V. I. Khandeev}, Comput. Math. Math. Phys. 59, No. 9, 1553--1561 (2019; Zbl 07150939); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 9, 1617--1625 (2019) Full Text: DOI OpenURL
Panda, B. S.; Verma, Shaily On partial Grundy coloring of bipartite graphs and chordal graphs. (English) Zbl 1428.05114 Discrete Appl. Math. 271, 171-183 (2019). MSC: 05C15 68Q25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{S. Verma}, Discrete Appl. Math. 271, 171--183 (2019; Zbl 1428.05114) Full Text: DOI OpenURL
Xia, Dong; Yuan, Ming On polynomial time methods for exact low-rank tensor completion. (English) Zbl 1436.15031 Found. Comput. Math. 19, No. 6, 1265-1313 (2019). Reviewer: Ctirad Matonoha (Praha) MSC: 15A83 90C25 90C59 68Q25 PDF BibTeX XML Cite \textit{D. Xia} and \textit{M. Yuan}, Found. Comput. Math. 19, No. 6, 1265--1313 (2019; Zbl 1436.15031) Full Text: DOI arXiv OpenURL
Miao, Runjie; Yuan, Jinjiang; Huang, Fei Paths and trails in edge-colored weighted graphs. (English) Zbl 1436.68254 Theor. Comput. Sci. 799, 104-114 (2019). MSC: 68R10 05C22 05C38 05C85 68Q25 PDF BibTeX XML Cite \textit{R. Miao} et al., Theor. Comput. Sci. 799, 104--114 (2019; Zbl 1436.68254) Full Text: DOI OpenURL
Döcker, Janosch; Linz, Simone; Semple, Charles Displaying trees across two phylogenetic networks. (English) Zbl 1435.68231 Theor. Comput. Sci. 796, 129-146 (2019). MSC: 68R10 68Q17 68Q25 92D15 PDF BibTeX XML Cite \textit{J. Döcker} et al., Theor. Comput. Sci. 796, 129--146 (2019; Zbl 1435.68231) Full Text: DOI arXiv OpenURL
Meziani, Nadjat; Oulamara, Ammar; Boudhar, Mourad Two-machine flowshop scheduling problem with coupled-operations. (English) Zbl 1426.90128 Ann. Oper. Res. 275, No. 2, 511-530 (2019). MSC: 90B35 PDF BibTeX XML Cite \textit{N. Meziani} et al., Ann. Oper. Res. 275, No. 2, 511--530 (2019; Zbl 1426.90128) Full Text: DOI OpenURL
Gu, Qian-Ping; Liang, Jiajian Leo; Zhang, Guochuan Efficient algorithms for ridesharing of personal vehicles. (English) Zbl 1433.90135 Theor. Comput. Sci. 788, 79-94 (2019). MSC: 90C27 68Q25 90B06 68W40 90C39 90C59 PDF BibTeX XML Cite \textit{Q.-P. Gu} et al., Theor. Comput. Sci. 788, 79--94 (2019; Zbl 1433.90135) Full Text: DOI OpenURL
Grußien, Berit Capturing logarithmic space and polynomial time on chordal claw-free graphs. (English) Zbl 1440.68108 Log. Methods Comput. Sci. 15, No. 3, Paper No. 2, 34 p. (2019). MSC: 68Q19 68Q15 68R10 PDF BibTeX XML Cite \textit{B. Grußien}, Log. Methods Comput. Sci. 15, No. 3, Paper No. 2, 34 p. (2019; Zbl 1440.68108) Full Text: arXiv OpenURL
Vakhania, Nodari Fast solution of single-machine scheduling problem with embedded jobs. (English) Zbl 1425.90050 Theor. Comput. Sci. 782, 91-106 (2019). MSC: 90B35 68W40 PDF BibTeX XML Cite \textit{N. Vakhania}, Theor. Comput. Sci. 782, 91--106 (2019; Zbl 1425.90050) Full Text: DOI OpenURL
Bang-Jensen, Jørgen; Bessy, Stéphane Degree-constrained 2-partitions of graphs. (English) Zbl 1427.68226 Theor. Comput. Sci. 776, 64-74 (2019). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C70 68Q25 PDF BibTeX XML Cite \textit{J. Bang-Jensen} and \textit{S. Bessy}, Theor. Comput. Sci. 776, 64--74 (2019; Zbl 1427.68226) Full Text: DOI arXiv Link OpenURL
Ganian, R.; Narayanaswamy, N. S.; Ordyniak, S.; Rahul, C. S.; Ramanujan, M. S. On the complexity landscape of connected \(f\)-factor problems. (English) Zbl 1422.68110 Algorithmica 81, No. 6, 2606-2632 (2019). MSC: 68Q25 05C40 68Q17 68W20 PDF BibTeX XML Cite \textit{R. Ganian} et al., Algorithmica 81, No. 6, 2606--2632 (2019; Zbl 1422.68110) Full Text: DOI OpenURL
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod When can graph hyperbolicity be computed in linear time? (English) Zbl 1439.68016 Algorithmica 81, No. 5, 2016-2045 (2019). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDF BibTeX XML Cite \textit{T. Fluschnik} et al., Algorithmica 81, No. 5, 2016--2045 (2019; Zbl 1439.68016) Full Text: DOI Link OpenURL
Haddou, Mounir; Migot, Tangi; Omer, Jérémy A generalized direction in interior point method for monotone linear complementarity problems. (English) Zbl 1417.90138 Optim. Lett. 13, No. 1, 35-53 (2019). MSC: 90C33 90C51 PDF BibTeX XML Cite \textit{M. Haddou} et al., Optim. Lett. 13, No. 1, 35--53 (2019; Zbl 1417.90138) Full Text: DOI HAL OpenURL
Grußien, Berit Capturing polynomial time using modular decomposition. (English) Zbl 1411.68045 Log. Methods Comput. Sci. 15, No. 1, Paper No. 24, 38 p. (2019). Reviewer: Gregory Loren McColm (Tampa) MSC: 68Q19 03B70 03C13 05C60 68Q15 68R10 PDF BibTeX XML Cite \textit{B. Grußien}, Log. Methods Comput. Sci. 15, No. 1, Paper No. 24, 38 p. (2019; Zbl 1411.68045) Full Text: arXiv OpenURL
Agrawal, Manindra; Kayal, Neeraj; Saxena, Nitin Erratum: “PRIMES is in P”. (English) Zbl 1432.11180 Ann. Math. (2) 189, No. 1, 317-318 (2019). MSC: 11Y11 11Y16 68Q25 68Q15 11A51 PDF BibTeX XML Cite \textit{M. Agrawal} et al., Ann. Math. (2) 189, No. 1, 317--318 (2019; Zbl 1432.11180) Full Text: DOI OpenURL
Chen, Bo; Zhang, Xiandong Scheduling with time-of-use costs. (English) Zbl 1430.90249 Eur. J. Oper. Res. 274, No. 3, 900-908 (2019). MSC: 90B35 90C59 90C60 PDF BibTeX XML Cite \textit{B. Chen} and \textit{X. Zhang}, Eur. J. Oper. Res. 274, No. 3, 900--908 (2019; Zbl 1430.90249) Full Text: DOI Link OpenURL
Brandstädt, Andreas; Milanič, Martin A dichotomy for weighted efficient dominating sets with bounded degree vertices. (English) Zbl 1469.68073 Inf. Process. Lett. 142, 30-34 (2019). MSC: 68R10 05C69 05C85 68Q25 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{M. Milanič}, Inf. Process. Lett. 142, 30--34 (2019; Zbl 1469.68073) Full Text: DOI OpenURL
Chitturi, Bhadrachalam; Balachander, Srijith; Satheesh, Sandeep; Puthiyoppil, Krithic Layered graphs: applications and algorithms. (English) Zbl 1461.68148 Algorithms (Basel) 11, No. 7, Paper No. 93, 22 p. (2018). MSC: 68R10 05C69 68Q25 PDF BibTeX XML Cite \textit{B. Chitturi} et al., Algorithms (Basel) 11, No. 7, Paper No. 93, 22 p. (2018; Zbl 1461.68148) Full Text: DOI OpenURL
Shen, Peiping; Huang, Bingdi A fully polynomial time approximation algorithm for linear fractional multiplicative programs. (Chinese. English summary) Zbl 1438.90349 Math. Appl. 31, No. 4, 927-932 (2018). MSC: 90C32 90C59 90C05 90C26 PDF BibTeX XML Cite \textit{P. Shen} and \textit{B. Huang}, Math. Appl. 31, No. 4, 927--932 (2018; Zbl 1438.90349) OpenURL
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 1428.90117 Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 545-553 (2018). MSC: 90C25 90C20 52B55 68Q25 PDF BibTeX XML Cite \textit{J. A. De Loera} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 545--553 (2018; Zbl 1428.90117) Full Text: DOI arXiv OpenURL
Saraf, Shubhangi; Volkovich, Ilya Black-box identity testing of depth-4 multilinear circuits. (English) Zbl 1424.68078 Combinatorica 38, No. 5, 1205-1238 (2018). MSC: 68Q25 12Y05 94C10 94C12 PDF BibTeX XML Cite \textit{S. Saraf} and \textit{I. Volkovich}, Combinatorica 38, No. 5, 1205--1238 (2018; Zbl 1424.68078) Full Text: DOI OpenURL
Fomin, Fedorr V.; Lokshtanov, Daniel; Saurabh, Saket Excluded grid minors and efficient polynomial-time approximation schemes. (English) Zbl 1426.68303 J. ACM 65, No. 2, Article No. 10, 44 p. (2018). MSC: 68W25 05C62 05C69 05C70 05C85 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., J. ACM 65, No. 2, Article No. 10, 44 p. (2018; Zbl 1426.68303) Full Text: DOI OpenURL
Baumeler, Ämin; Wolf, Stefan Computational tameness of classical non-causal models. (English) Zbl 1402.81082 Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 474, No. 2209, Article ID 20170698, 13 p. (2018). MSC: 81P68 68Q05 68Q15 PDF BibTeX XML Cite \textit{Ä. Baumeler} and \textit{S. Wolf}, Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 474, No. 2209, Article ID 20170698, 13 p. (2018; Zbl 1402.81082) Full Text: DOI arXiv OpenURL
Lokshtanov, Daniel; Pilipczuk, Marcin; Leeuwen, Erik Jan Van Independence and efficient domination on \(P_6\)-free graphs. (English) Zbl 1431.68049 ACM Trans. Algorithms 14, No. 1, Article No. 3, 30 p. (2018). MSC: 68Q25 05C69 05C85 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., ACM Trans. Algorithms 14, No. 1, Article No. 3, 30 p. (2018; Zbl 1431.68049) Full Text: DOI arXiv OpenURL
Tarkowski, Mateusz K.; Szczepański, Piotr L.; Michalak, Tomasz P.; Harrenstein, Paul; Wooldridge, Michael Efficient computation of semivalues for game-theoretic network centrality. (English) Zbl 1454.91052 J. Artif. Intell. Res. (JAIR) 63, 145-189 (2018). MSC: 91A68 91A12 PDF BibTeX XML Cite \textit{M. K. Tarkowski} et al., J. Artif. Intell. Res. (JAIR) 63, 145--189 (2018; Zbl 1454.91052) Full Text: DOI OpenURL
Ospichev, S.; Ponomarev, D. On the complexity of formulas in semantic programming. (English) Zbl 1403.03061 Sib. Èlektron. Mat. Izv. 15, 987-995 (2018). MSC: 03D15 68Q15 68Q17 PDF BibTeX XML Cite \textit{S. Ospichev} and \textit{D. Ponomarev}, Sib. Èlektron. Mat. Izv. 15, 987--995 (2018; Zbl 1403.03061) OpenURL
Xiao, Mingyu; Nagamochi, Hiroshi Characterizing star-PCGs. (English) Zbl 1459.05317 Wang, Lusheng (ed.) et al., Computing and combinatorics. 24th international conference, COCOON 2018, Qing Dao, China, July 2–4, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10976, 504-515 (2018). MSC: 05C85 68Q25 PDF BibTeX XML Cite \textit{M. Xiao} and \textit{H. Nagamochi}, Lect. Notes Comput. Sci. 10976, 504--515 (2018; Zbl 1459.05317) Full Text: DOI arXiv OpenURL
Deligkas, Argyrios; Fearnley, John; Savani, Rahul Inapproximability results for constrained approximate Nash equilibria. (English) Zbl 1400.68086 Inf. Comput. 262, Part 1, 40-56 (2018). MSC: 68Q25 68Q17 91A10 PDF BibTeX XML Cite \textit{A. Deligkas} et al., Inf. Comput. 262, Part 1, 40--56 (2018; Zbl 1400.68086) Full Text: DOI OpenURL
Malyshev, D. S. The weighted coloring problem for two graph classes characterized by small forbidden induced structures. (English) Zbl 1394.05034 Discrete Appl. Math. 247, 423-432 (2018). MSC: 05C15 05C85 05C75 68Q17 PDF BibTeX XML Cite \textit{D. S. Malyshev}, Discrete Appl. Math. 247, 423--432 (2018; Zbl 1394.05034) Full Text: DOI OpenURL
Alaev, Pavel; Selivanov, Victor Polynomial-time presentations of algebraic number fields. (English) Zbl 06932454 Manea, Florin (ed.) et al., Sailing routes in the world of computation. 14th conference on computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10936, 20-29 (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Alaev} and \textit{V. Selivanov}, Lect. Notes Comput. Sci. 10936, 20--29 (2018; Zbl 06932454) Full Text: DOI OpenURL
Yuan, Jinjiang Complexities of four problems on two-agent scheduling. (English) Zbl 1403.90378 Optim. Lett. 12, No. 4, 763-780 (2018). MSC: 90B35 90C60 PDF BibTeX XML Cite \textit{J. Yuan}, Optim. Lett. 12, No. 4, 763--780 (2018; Zbl 1403.90378) Full Text: DOI OpenURL
Muzychuk, Mikhail; Ponomarenko, Ilia Finding a cycle base of a permutation group in polynomial time. (English) Zbl 1446.20009 J. Algebra 510, 542-561 (2018). Reviewer: John D. Dixon (Ottawa) MSC: 20B25 20B35 20-08 68Q25 PDF BibTeX XML Cite \textit{M. Muzychuk} and \textit{I. Ponomarenko}, J. Algebra 510, 542--561 (2018; Zbl 1446.20009) Full Text: DOI arXiv OpenURL
Hirai, Hiroshi; Namba, Hiroyuki Shortest \((A+B)\)-path packing via hafnian. (English) Zbl 1396.68058 Algorithmica 80, No. 8, 2478-2491 (2018). MSC: 68Q25 05C50 68W20 90C27 PDF BibTeX XML Cite \textit{H. Hirai} and \textit{H. Namba}, Algorithmica 80, No. 8, 2478--2491 (2018; Zbl 1396.68058) Full Text: DOI arXiv OpenURL
Pilz, Alexander; Welzl, Emo Order on order types. (English) Zbl 1394.52029 Discrete Comput. Geom. 59, No. 4, 886-922 (2018). MSC: 52C45 52C99 PDF BibTeX XML Cite \textit{A. Pilz} and \textit{E. Welzl}, Discrete Comput. Geom. 59, No. 4, 886--922 (2018; Zbl 1394.52029) Full Text: DOI OpenURL
Huang, Dandan; Deng, Yingpu An algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank. (English) Zbl 1414.11167 Sci. China, Math. 61, No. 5, 783-796 (2018). MSC: 11Y40 68Q25 PDF BibTeX XML Cite \textit{D. Huang} and \textit{Y. Deng}, Sci. China, Math. 61, No. 5, 783--796 (2018; Zbl 1414.11167) Full Text: DOI arXiv OpenURL
Alpers, Andreas; Gritzmann, Peter On double-resolution imaging and discrete tomography. (English) Zbl 1395.68321 SIAM J. Discrete Math. 32, No. 2, 1369-1399 (2018). MSC: 68U10 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Alpers} and \textit{P. Gritzmann}, SIAM J. Discrete Math. 32, No. 2, 1369--1399 (2018; Zbl 1395.68321) Full Text: DOI arXiv OpenURL
Hainry, Emmanuel; Péchoux, Romain A type-based complexity analysis of object oriented programs. (English) Zbl 1395.68087 Inf. Comput. 261, Part 1, 78-115 (2018). MSC: 68N19 68Q25 PDF BibTeX XML Cite \textit{E. Hainry} and \textit{R. Péchoux}, Inf. Comput. 261, Part 1, 78--115 (2018; Zbl 1395.68087) Full Text: DOI arXiv OpenURL
Avanzini, Martin; Dal Lago, Ugo On sharing, memoization, and polynomial time. (English) Zbl 1395.68134 Inf. Comput. 261, Part 1, 3-22 (2018). MSC: 68Q15 68Q25 PDF BibTeX XML Cite \textit{M. Avanzini} and \textit{U. Dal Lago}, Inf. Comput. 261, Part 1, 3--22 (2018; Zbl 1395.68134) Full Text: DOI OpenURL
Bang-Jensen, J.; Huang, J.; Zhu, X. Completing orientations of partially oriented graphs. (English) Zbl 1386.05121 J. Graph Theory 87, No. 3, 285-304 (2018). MSC: 05C62 05C20 68Q25 PDF BibTeX XML Cite \textit{J. Bang-Jensen} et al., J. Graph Theory 87, No. 3, 285--304 (2018; Zbl 1386.05121) Full Text: DOI arXiv OpenURL
Li, Weidong; Cui, Qianna Vector scheduling with rejection on a single machine. (English) Zbl 1384.90046 4OR 16, No. 1, 95-104 (2018). MSC: 90B35 90C60 90C39 PDF BibTeX XML Cite \textit{W. Li} and \textit{Q. Cui}, 4OR 16, No. 1, 95--104 (2018; Zbl 1384.90046) Full Text: DOI OpenURL
Fluschnik, Till; Hermelin, Danny; Nichterlein, André; Niedermeier, Rolf Fractals for kernelization lower bounds. (English) Zbl 1388.68112 SIAM J. Discrete Math. 32, No. 1, 656-681 (2018). MSC: 68Q25 68Q17 68R10 PDF BibTeX XML Cite \textit{T. Fluschnik} et al., SIAM J. Discrete Math. 32, No. 1, 656--681 (2018; Zbl 1388.68112) Full Text: DOI arXiv OpenURL
Pakusa, Wied; Schalthöfer, Svenja; Selman, Erkal Definability of Cai-Fürer-Immerman problems in choiceless polynomial time. (English) Zbl 1407.68199 ACM Trans. Comput. Log. 19, No. 2, Article No. 7, 27 p. (2018). MSC: 68Q19 03C13 68Q15 PDF BibTeX XML Cite \textit{W. Pakusa} et al., ACM Trans. Comput. Log. 19, No. 2, Article No. 7, 27 p. (2018; Zbl 1407.68199) Full Text: DOI Link OpenURL
Li, Xianyue; Zhang, Zhao; Du, Ding-Zhu Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm. (English) Zbl 1393.90104 J. Glob. Optim. 70, No. 3, 677-685 (2018). MSC: 90C27 90C60 PDF BibTeX XML Cite \textit{X. Li} et al., J. Glob. Optim. 70, No. 3, 677--685 (2018; Zbl 1393.90104) Full Text: DOI OpenURL
Földvári, Attila The complexity of the equation solvability problem over nilpotent groups. (English) Zbl 1427.20039 J. Algebra 495, 289-303 (2018). MSC: 20F10 20D15 20F18 20F70 68Q25 PDF BibTeX XML Cite \textit{A. Földvári}, J. Algebra 495, 289--303 (2018; Zbl 1427.20039) Full Text: DOI Link OpenURL
Yokoi, Yu Envy-free matchings with lower quotas. (English) Zbl 1457.91275 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 67, 12 p. (2017). MSC: 91B68 68Q25 PDF BibTeX XML Cite \textit{Y. Yokoi}, LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 67, 12 p. (2017; Zbl 1457.91275) Full Text: DOI OpenURL
Bérczi, Kristóf; Kobayashi, Yusuke The directed disjoint shortest paths problem. (English) Zbl 1445.68149 Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 13, 13 p. (2017). MSC: 68R10 05C20 05C38 68Q25 PDF BibTeX XML Cite \textit{K. Bérczi} and \textit{Y. Kobayashi}, LIPIcs -- Leibniz Int. Proc. Inform. 87, Article 13, 13 p. (2017; Zbl 1445.68149) Full Text: DOI OpenURL
Grußien, Berit Capturing logarithmic space and polynomial time on chordal claw-free graphs. (English) Zbl 1440.68109 Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 26, 19 p. (2017). MSC: 68Q19 68Q15 68R10 PDF BibTeX XML Cite \textit{B. Grußien}, LIPIcs -- Leibniz Int. Proc. Inform. 82, Article 26, 19 p. (2017; Zbl 1440.68109) Full Text: DOI OpenURL
Schwichtenberg, Helmut; Wainer, Stanley S. Tiered arithmetics. (English) Zbl 1429.03150 Jäger, Gerhard (ed.) et al., Feferman on foundations. Logic, mathematics, philosophy. Cham: Springer. Outst. Contrib. Log. 13, 145-168 (2017). MSC: 03D20 03D15 03F05 03F30 PDF BibTeX XML Cite \textit{H. Schwichtenberg} and \textit{S. S. Wainer}, Outst. Contrib. Log. 13, 145--168 (2017; Zbl 1429.03150) Full Text: DOI OpenURL
Kurup, Ajith S.; George, Mathews M. An introduction to NP-completeness in fuzzy context. (English) Zbl 1400.68076 J. Fuzzy Math. 25, No. 2, 259-266 (2017). MSC: 68Q17 68Q15 PDF BibTeX XML Cite \textit{A. S. Kurup} and \textit{M. M. George}, J. Fuzzy Math. 25, No. 2, 259--266 (2017; Zbl 1400.68076) OpenURL
Beggs, Edwin; Cortez, Pedro; Costa, José Félix; Tucker, John V. A hierarchy for BPP//log\(\star\) based on counting calls to an oracle. (English) Zbl 1396.68049 Adamatzky, Andrew (ed.), Emergent computation. A Festschrift for Selim G. Akl. Cham: Springer (ISBN 978-3-319-46375-9/hbk; 978-3-319-46376-6/ebook). Emergence, Complexity and Computation 24, 39-56 (2017). MSC: 68Q15 68Q05 68Q87 PDF BibTeX XML Cite \textit{E. Beggs} et al., Emerg. Complex. Comput. 24, 39--56 (2017; Zbl 1396.68049) Full Text: DOI OpenURL