Brakensiek, Joshua; Gopi, Sivakanth; Guruswami, Venkatesan Constraint satisfaction problems with global modular constraints: algorithms and hardness via polynomial representations. (English) Zbl 07538272 SIAM J. Comput. 51, No. 3, 577-626 (2022). MSC: 68Q25 94B05 20K01 68W20 08A70 03B70 12Y05 PDF BibTeX XML Cite \textit{J. Brakensiek} et al., SIAM J. Comput. 51, No. 3, 577--626 (2022; Zbl 07538272) Full Text: DOI OpenURL
Couceiro, Miguel; Haddad, Lucien; Lagerkvist, Victor A survey on the fine-grained complexity of constraint satisfaction problems based on partial polymorphisms. (English) Zbl 07536562 J. Mult.-Val. Log. Soft Comput. 38, No. 1-2, 115-136 (2022). MSC: 08A40 08A55 68Q25 PDF BibTeX XML Cite \textit{M. Couceiro} et al., J. Mult.-Val. Log. Soft Comput. 38, No. 1--2, 115--136 (2022; Zbl 07536562) Full Text: Link OpenURL
Manurangsi, Pasin; Nakkiran, Preetum; Trevisan, Luca Near-optimal NP-hardness of approximating Max \(k\)-\(\mathrm{CSP}_R\). (English) Zbl 07528579 Theory Comput. 18, Paper No. 3, 29 p. (2022). MSC: 68Q17 68W25 PDF BibTeX XML Cite \textit{P. Manurangsi} et al., Theory Comput. 18, Paper No. 3, 29 p. (2022; Zbl 07528579) Full Text: DOI OpenURL
Bidar, Mahdi; Mouhoub, Malek Nature-inspired techniques for dynamic constraint satisfaction problems. (English) Zbl 07528438 SN Oper. Res. Forum 3, No. 2, Paper No. 28, 33 p. (2022). MSC: 90Cxx PDF BibTeX XML Cite \textit{M. Bidar} and \textit{M. Mouhoub}, SN Oper. Res. Forum 3, No. 2, Paper No. 28, 33 p. (2022; Zbl 07528438) Full Text: DOI OpenURL
Surynek, Pavel; Stern, Roni; Boyarski, Eli; Felner, Ariel Migrating techniques from search-based multi-agent path finding solvers to SAT-based approach. (English) Zbl 07527534 J. Artif. Intell. Res. (JAIR) 73, 553-618 (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{P. Surynek} et al., J. Artif. Intell. Res. (JAIR) 73, 553--618 (2022; Zbl 07527534) Full Text: DOI OpenURL
Ganian, Robert; Kim, Eun Jung; Slivovsky, Friedrich; Szeider, Stefan Sum-of-products with default values: algorithms and complexity results. (English) Zbl 07527533 J. Artif. Intell. Res. (JAIR) 73, 535-552 (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{R. Ganian} et al., J. Artif. Intell. Res. (JAIR) 73, 535--552 (2022; Zbl 07527533) Full Text: DOI OpenURL
Stanković, Aleksa On regularity of Max-CSPs and Min-CSPs. (English) Zbl 1484.68332 Inf. Process. Lett. 176, Article ID 106244, 17 p. (2022). MSC: 68W25 68R07 PDF BibTeX XML Cite \textit{A. Stanković}, Inf. Process. Lett. 176, Article ID 106244, 17 p. (2022; Zbl 1484.68332) Full Text: DOI OpenURL
Gillibert, Pierre; Jonušas, Julius; Kompatscher, Michael; Mottet, Antoine; Pinsker, Michael When symmetries are not enough: a hierarchy of hard constraint satisfaction problems. (English) Zbl 1483.68141 SIAM J. Comput. 51, No. 2, 175-213 (2022). MSC: 68Q15 03C05 03C35 08A40 08A70 68R07 PDF BibTeX XML Cite \textit{P. Gillibert} et al., SIAM J. Comput. 51, No. 2, 175--213 (2022; Zbl 1483.68141) Full Text: DOI OpenURL
Neumaier, Arnold; Penjić, Safet A unified view of inequalities for distance-regular graphs. I. (English) Zbl 1483.05204 J. Comb. Theory, Ser. B 154, 392-439 (2022). MSC: 05E30 05C75 05C12 05C25 05-02 PDF BibTeX XML Cite \textit{A. Neumaier} and \textit{S. Penjić}, J. Comb. Theory, Ser. B 154, 392--439 (2022; Zbl 1483.05204) Full Text: DOI OpenURL
San Segundo, Pablo; Furini, Fabio; León, Rafael A new branch-and-filter exact algorithm for binary constraint satisfaction problems. (English) Zbl 07479751 Eur. J. Oper. Res. 299, No. 2, 448-467 (2022). MSC: 90Bxx PDF BibTeX XML Cite \textit{P. San Segundo} et al., Eur. J. Oper. Res. 299, No. 2, 448--467 (2022; Zbl 07479751) Full Text: DOI OpenURL
Lin, Jiabao The complexity of counting \(\mathrm{CSP}^d\). (English) Zbl 07473210 Theory Comput. Syst. 66, No. 1, 309-321 (2022). MSC: 68Qxx 05Cxx 68Rxx PDF BibTeX XML Cite \textit{J. Lin}, Theory Comput. Syst. 66, No. 1, 309--321 (2022; Zbl 07473210) Full Text: DOI OpenURL
Komo, Christian; Beierle, Christoph Nonmonotonic reasoning from conditional knowledge bases with system W. (English) Zbl 07473196 Ann. Math. Artif. Intell. 90, No. 1, 107-144 (2022). MSC: 68T27 68T30 68T37 PDF BibTeX XML Cite \textit{C. Komo} and \textit{C. Beierle}, Ann. Math. Artif. Intell. 90, No. 1, 107--144 (2022; Zbl 07473196) Full Text: DOI OpenURL
Carbonnel, Clément; Romero, Miguel; Živný, Stanislav The complexity of general-valued constraint satisfaction problems seen from the other side. (English) Zbl 07470541 SIAM J. Comput. 51, No. 1, 19-69 (2022). MSC: 68Q25 68R01 03B70 90C05 PDF BibTeX XML Cite \textit{C. Carbonnel} et al., SIAM J. Comput. 51, No. 1, 19--69 (2022; Zbl 07470541) Full Text: DOI arXiv OpenURL
Zhuk, Dmitriy Strong subalgebras and the constraint satisfaction problem. (English) Zbl 07536113 J. Mult.-Val. Log. Soft Comput. 36, No. 4-5, 455-504 (2021). MSC: 08A30 68Q25 PDF BibTeX XML Cite \textit{D. Zhuk}, J. Mult.-Val. Log. Soft Comput. 36, No. 4--5, 455--504 (2021; Zbl 07536113) Full Text: Link OpenURL
Brandts, Alex; Wrochna, Marcin; Živný, Stanislav The complexity of promise SAT on non-Boolean domains. (English) Zbl 07499574 ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{A. Brandts} et al., ACM Trans. Comput. Theory 13, No. 4, Article No. 26, 20 p. (2021; Zbl 07499574) Full Text: DOI OpenURL
Jonsson, Peter; Lagerkvist, Victor; Roy, Biman Fine-grained time complexity of constraint satisfaction problems. (English) Zbl 07489204 ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{P. Jonsson} et al., ACM Trans. Comput. Theory 13, No. 1, Article No. 2, 32 p. (2021; Zbl 07489204) Full Text: DOI OpenURL
Mastrolilli, Monaldo The complexity of the ideal membership problem for constrained problems over the Boolean domain. (English) Zbl 07479302 ACM Trans. Algorithms 17, No. 4, Article No. 32, 29 p. (2021). MSC: 68Q25 13P10 PDF BibTeX XML Cite \textit{M. Mastrolilli}, ACM Trans. Algorithms 17, No. 4, Article No. 32, 29 p. (2021; Zbl 07479302) Full Text: DOI OpenURL
Brakensiek, Joshua; Guruswami, Venkatesan The quest for strong inapproximability results with perfect completeness. (English) Zbl 07475107 ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021). MSC: 68Q17 05C15 05C65 68R07 68W25 PDF BibTeX XML Cite \textit{J. Brakensiek} and \textit{V. Guruswami}, ACM Trans. Algorithms 17, No. 3, Article No. 27, 35 p. (2021; Zbl 07475107) Full Text: DOI OpenURL
Viola, Caterina; Živný, Stanislav The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains. (English) Zbl 07475101 ACM Trans. Algorithms 17, No. 3, Article No. 21, 23 p. (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{C. Viola} and \textit{S. Živný}, ACM Trans. Algorithms 17, No. 3, Article No. 21, 23 p. (2021; Zbl 07475101) Full Text: DOI arXiv OpenURL
Belakaria, Syrine; Deshwal, Aryan; Doppa, Janardhan Rao Output space entropy search framework for multi-objective Bayesian optimization. (English) Zbl 07470363 J. Artif. Intell. Res. (JAIR) 72, 667-715 (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{S. Belakaria} et al., J. Artif. Intell. Res. (JAIR) 72, 667--715 (2021; Zbl 07470363) Full Text: DOI arXiv OpenURL
Kupriyanov, B. V.; Lazarev, A. A. Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. (English. Russian original) Zbl 1481.90173 Autom. Remote Control 82, No. 11, 1892-1906 (2021); translation from Avtom. Telemekh. 2021, No. 11, 75-93 (2021). MSC: 90B35 68T20 91B32 68Q15 PDF BibTeX XML Cite \textit{B. V. Kupriyanov} and \textit{A. A. Lazarev}, Autom. Remote Control 82, No. 11, 1892--1906 (2021; Zbl 1481.90173); translation from Avtom. Telemekh. 2021, No. 11, 75--93 (2021) Full Text: DOI OpenURL
Bodirsky, Manuel; Mamino, Marcello; Viola, Caterina Piecewise linear valued constraint satisfaction problems with fixed number of variables. (English) Zbl 1481.90270 Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 265-276 (2021). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., AIRO Springer Ser. 5, 265--276 (2021; Zbl 1481.90270) Full Text: DOI arXiv OpenURL
Baader, Franz; Rydval, Jakub An algebraic view on p-admissible concrete domains for lightweight description logics. (English) Zbl 07437042 Faber, Wolfgang (ed.) et al., Logics in artificial intelligence. 17th European conference, JELIA 2021, virtual event, May 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12678, 194-209 (2021). MSC: 68T27 PDF BibTeX XML Cite \textit{F. Baader} and \textit{J. Rydval}, Lect. Notes Comput. Sci. 12678, 194--209 (2021; Zbl 07437042) Full Text: DOI OpenURL
Bodirsky, Manuel; Quinn-Gregson, Thomas Solving equation systems in \(\omega \)-categorical algebras. (English) Zbl 07419669 J. Math. Log. 21, No. 3, Article ID 2150020, 31 p. (2021). MSC: 03-XX PDF BibTeX XML Cite \textit{M. Bodirsky} and \textit{T. Quinn-Gregson}, J. Math. Log. 21, No. 3, Article ID 2150020, 31 p. (2021; Zbl 07419669) Full Text: DOI arXiv OpenURL
Jonsson, Peter; Lagerkvist, Victor; Osipov, George Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms. (English) Zbl 07418620 Artif. Intell. 296, Article ID 103505, 15 p. (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{P. Jonsson} et al., Artif. Intell. 296, Article ID 103505, 15 p. (2021; Zbl 07418620) Full Text: DOI OpenURL
Jonsson, Peter; Lagerkvist, Victor; Schmidt, Johannes; Uppman, Hannes The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. (English) Zbl 07412752 Theor. Comput. Sci. 892, 1-24 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Jonsson} et al., Theor. Comput. Sci. 892, 1--24 (2021; Zbl 07412752) Full Text: DOI OpenURL
Livieratos, John; Kolaitis, Phokion G.; Kirousis, Lefteris On the computational complexity of non-dictatorial aggregation. (English) Zbl 07406496 J. Artif. Intell. Res. (JAIR) 72, 137-183 (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{J. Livieratos} et al., J. Artif. Intell. Res. (JAIR) 72, 137--183 (2021; Zbl 07406496) Full Text: DOI OpenURL
Bodirsky, Manuel; Madelaine, Florent; Mottet, Antoine A proof of the algebraic tractability conjecture for monotone monadic SNP. (English) Zbl 07393743 SIAM J. Comput. 50, No. 4, 1359-1409 (2021). MSC: 03B70 68Q19 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., SIAM J. Comput. 50, No. 4, 1359--1409 (2021; Zbl 07393743) Full Text: DOI OpenURL
Kozik, Marcin Solving CSPs using weak local consistency. (English) Zbl 07379409 SIAM J. Comput. 50, No. 4, 1263-1286 (2021). MSC: 68Q19 68Q25 03D15 PDF BibTeX XML Cite \textit{M. Kozik}, SIAM J. Comput. 50, No. 4, 1263--1286 (2021; Zbl 07379409) Full Text: DOI OpenURL
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Živný, Stanislav Galois connections for patterns: an algebra of labelled graphs. (English) Zbl 1467.68176 Cochez, Michael (ed.) et al., Graph structures for knowledge representation and reasoning. 6th international workshop, GKR 2020, virtual event, September 5, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12640, 125-150 (2021). MSC: 68T30 05C78 06A15 68R10 PDF BibTeX XML Cite \textit{D. A. Cohen} et al., Lect. Notes Comput. Sci. 12640, 125--150 (2021; Zbl 1467.68176) Full Text: DOI OpenURL
Hirai, Hiroshi; Mizutani, Ryuhei Minimum 0-extension problems on directed metrics. (English) Zbl 07375478 Discrete Optim. 40, Article ID 100642, 25 p. (2021). MSC: 90Cxx PDF BibTeX XML Cite \textit{H. Hirai} and \textit{R. Mizutani}, Discrete Optim. 40, Article ID 100642, 25 p. (2021; Zbl 07375478) Full Text: DOI arXiv OpenURL
Farajzadeh-D., Mohammad-G.; Sani, S. K. Hosseini An improved two-loop model predictive control design for nonlinear robust reference tracking with practical advantages. (English) Zbl 1469.93021 Optim. Control Appl. Methods 42, No. 2, 548-565 (2021). MSC: 93B45 93C10 93B35 PDF BibTeX XML Cite \textit{M.-G. Farajzadeh-D.} and \textit{S. K. H. Sani}, Optim. Control Appl. Methods 42, No. 2, 548--565 (2021; Zbl 1469.93021) Full Text: DOI OpenURL
Bodirsky, Manuel; Pinsker, Michael; Pongrácz, András Projective clone homomorphisms. (English) Zbl 07370805 J. Symb. Log. 86, No. 1, 148-161 (2021). MSC: 03C05 03C40 08A70 08A35 08A30 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., J. Symb. Log. 86, No. 1, 148--161 (2021; Zbl 07370805) Full Text: DOI arXiv Link OpenURL
Benouhiba, Toufik A multi-level refinement approach for structural synthesis of optimal probabilistic models. (English) Zbl 07355384 Fundam. Inform. 179, No. 1, 1-33 (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{T. Benouhiba}, Fundam. Inform. 179, No. 1, 1--33 (2021; Zbl 07355384) Full Text: DOI OpenURL
Jastrzab, Tomasz; Czech, Zbigniew J.; Wieczorek, Wojciech Parallel algorithms for minimal nondeterministic finite automata inference. (English) Zbl 1482.68114 Fundam. Inform. 178, No. 3, 203-227 (2021). MSC: 68Q32 68Q45 68W10 PDF BibTeX XML Cite \textit{T. Jastrzab} et al., Fundam. Inform. 178, No. 3, 203--227 (2021; Zbl 1482.68114) Full Text: DOI OpenURL
Vyas, Nikhil; Williams, Ryan On super strong ETH. (English) Zbl 07328087 J. Artif. Intell. Res. (JAIR) 70, 473-495 (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{N. Vyas} and \textit{R. Williams}, J. Artif. Intell. Res. (JAIR) 70, 473--495 (2021; Zbl 07328087) Full Text: DOI OpenURL
Escamocher, Guillaume; O’Sullivan, Barry Leprechauns on the chessboard. (English) Zbl 07327853 Discrete Math. 344, No. 5, Article ID 112316, 17 p. (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{G. Escamocher} and \textit{B. O'Sullivan}, Discrete Math. 344, No. 5, Article ID 112316, 17 p. (2021; Zbl 07327853) Full Text: DOI OpenURL
Deng, Guofeng; Sai, Ezzeddine El; Manders, Trevor; Mayr, Peter; Nakkirt, Poramate; Sparks, Athena Sandwiches for promise constraint satisfaction. (English) Zbl 07317148 Algebra Univers. 82, No. 1, Paper No. 15, 9 p. (2021). MSC: 68Q17 PDF BibTeX XML Cite \textit{G. Deng} et al., Algebra Univers. 82, No. 1, Paper No. 15, 9 p. (2021; Zbl 07317148) Full Text: DOI arXiv OpenURL
Duraj, Lech; Kozik, Jakub; Shabanov, Dmitry Random hypergraphs and property B. (English) Zbl 1458.05237 Eur. J. Comb. 91, Article ID 103205, 11 p. (2021). MSC: 05C80 05C65 05C15 68W20 PDF BibTeX XML Cite \textit{L. Duraj} et al., Eur. J. Comb. 91, Article ID 103205, 11 p. (2021; Zbl 1458.05237) Full Text: DOI arXiv OpenURL
Briceño, Raimundo; Bulatov, Andrei; Dalmau, Víctor; Larose, Benoît Dismantlability, connectedness, and mixing in relational structures. (English) Zbl 07305038 J. Comb. Theory, Ser. B 147, 37-70 (2021). MSC: 68Txx 68Qxx PDF BibTeX XML Cite \textit{R. Briceño} et al., J. Comb. Theory, Ser. B 147, 37--70 (2021; Zbl 07305038) Full Text: DOI arXiv Link OpenURL
Lagerkvist, Victor; Roy, Biman Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem. (English) Zbl 1477.68127 J. Comput. Syst. Sci. 117, 23-39 (2021). MSC: 68Q25 08A70 68R07 PDF BibTeX XML Cite \textit{V. Lagerkvist} and \textit{B. Roy}, J. Comput. Syst. Sci. 117, 23--39 (2021; Zbl 1477.68127) Full Text: DOI OpenURL
De Filippo, Allegra; Lombardi, Michele; Milano, Michela Integrated offline and online decision making under uncertainty. (English) Zbl 07299929 J. Artif. Intell. Res. (JAIR) 70, 77-117 (2021). MSC: 68Txx PDF BibTeX XML Cite \textit{A. De Filippo} et al., J. Artif. Intell. Res. (JAIR) 70, 77--117 (2021; Zbl 07299929) Full Text: DOI OpenURL
Bodirsky, Manuel; Mottet, Antoine; Olšák, Miroslav; Opršal, Jakub; Pinsker, Michael; Willard, Ross \( \omega \)-categorical structures avoiding height 1 identities. (English) Zbl 1472.08006 Trans. Am. Math. Soc. 374, No. 1, 327-350 (2021). Reviewer: Keith Kearnes (Boulder) MSC: 08B05 03C05 08A70 03C10 03D15 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., Trans. Am. Math. Soc. 374, No. 1, 327--350 (2021; Zbl 1472.08006) Full Text: DOI arXiv OpenURL
Galanis, Andreas; Goldberg, Leslie Ann; Yang, Kuan Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems. (English) Zbl 1464.68272 J. Comput. Syst. Sci. 115, 187-213 (2021). MSC: 68R07 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Galanis} et al., J. Comput. Syst. Sci. 115, 187--213 (2021; Zbl 1464.68272) Full Text: DOI arXiv Link OpenURL
Tveretina, Olga; Zaichenkov, Pavel; Shafarenko, Alex Non-local configuration of component interfaces by constraint satisfaction. (English) Zbl 07446939 Constraints 25, No. 3-4, 121-159 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{O. Tveretina} et al., Constraints 25, No. 3--4, 121--159 (2020; Zbl 07446939) Full Text: DOI arXiv OpenURL
Montesino-Guerra, Juan A.; Puga, Héctor; Carpio, J. Martín; Ornelas-Rodríguez, Manuel; Rojas-Domínguez, A.; Ortiz-Aguilar, Lucero Combinatorial designs on constraint satisfaction problem (VRP). (English) Zbl 07392077 Castillo, Oscar (ed.) et al., Intuitionistic and type-2 fuzzy logic enhancements in neural and optimization algorithms: theory and applications. Cham: Springer. Stud. Comput. Intell. 862, 509-526 (2020). MSC: 68T37 PDF BibTeX XML Cite \textit{J. A. Montesino-Guerra} et al., Stud. Comput. Intell. 862, 509--526 (2020; Zbl 07392077) Full Text: DOI OpenURL
Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji Dichotomy for Holant\(^\ast\) problems on the Boolean domain. (English) Zbl 07357729 Theory Comput. Syst. 64, No. 8, 1362-1391 (2020). MSC: 68Rxx 81Pxx 68Qxx PDF BibTeX XML Cite \textit{J.-Y. Cai} et al., Theory Comput. Syst. 64, No. 8, 1362--1391 (2020; Zbl 07357729) Full Text: DOI Link OpenURL
Budzynski, Louise; Semerjian, Guilhem The asymptotics of the clustering transition for random constraint satisfaction problems. (English) Zbl 07327973 J. Stat. Phys. 181, No. 5, 1490-1522 (2020). MSC: 68Q87 68Q25 68T20 PDF BibTeX XML Cite \textit{L. Budzynski} and \textit{G. Semerjian}, J. Stat. Phys. 181, No. 5, 1490--1522 (2020; Zbl 07327973) Full Text: DOI arXiv OpenURL
Wrona, Michał On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width. (English) Zbl 07299525 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). 958-971 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{M. Wrona}, 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). 958--971 (2020; Zbl 07299525) Full Text: DOI arXiv OpenURL
Idziak, Paweł M.; Kawałek, Piotr; Krzaczkowski, Jacek Intermediate problems in modular circuits satisfiability. (English) Zbl 07299497 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). 578-590 (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{P. M. Idziak} 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). 578--590 (2020; Zbl 07299497) Full Text: DOI arXiv OpenURL
Bodirsky, Manuel; Pakusa, Wied; Rydval, Jakub Temporal constraint satisfaction problems in fixed-point logic. (English) Zbl 07299472 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). 237-251 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{M. Bodirsky} 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). 237--251 (2020; Zbl 07299472) Full Text: DOI arXiv OpenURL
Zhuk, Dmitriy; Martin, Barnaby QCSP monsters and the demise of the Chen conjecture. (English) Zbl 07298233 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 91-104 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Zhuk} and \textit{B. Martin}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 91--104 (2020; Zbl 07298233) Full Text: DOI arXiv Link OpenURL
Aït-Kaci, Hassan; Pasi, Gabriella Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach. (English) Zbl 1452.06008 Fuzzy Sets Syst. 391, 1-46 (2020). MSC: 06D72 68N17 PDF BibTeX XML Cite \textit{H. Aït-Kaci} and \textit{G. Pasi}, Fuzzy Sets Syst. 391, 1--46 (2020; Zbl 1452.06008) Full Text: DOI OpenURL
Naanaa, Wady New schemes for simplifying binary constraint satisfaction problems. (English) Zbl 1477.68292 Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 10, 29 p. (2020). Reviewer: Silvija Vlah Jerić (Zagreb) MSC: 68T20 68Q17 68Q27 PDF BibTeX XML Cite \textit{W. Naanaa}, Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 10, 29 p. (2020; Zbl 1477.68292) Full Text: DOI OpenURL
Robinson, E. I.; Marzat, J.; Raïssi, T. Prognosis of uncertain linear time-invariant discrete systems using unknown input interval observer. (English) Zbl 1454.93085 Int. J. Control 93, No. 11, 2690-2706 (2020). MSC: 93B53 93C41 93C55 PDF BibTeX XML Cite \textit{E. I. Robinson} et al., Int. J. Control 93, No. 11, 2690--2706 (2020; Zbl 1454.93085) Full Text: DOI OpenURL
Kaznatcheev, Artem; Cohen, David A.; Jeavons, Peter G. Representing fitness landscapes by valued constraints to understand the complexity of local search. (English) Zbl 07283372 J. Artif. Intell. Res. (JAIR) 69, 1077-1102 (2020). MSC: 68Txx PDF BibTeX XML Cite \textit{A. Kaznatcheev} et al., J. Artif. Intell. Res. (JAIR) 69, 1077--1102 (2020; Zbl 07283372) Full Text: DOI arXiv OpenURL
Konishi, Tatsuya; Kojima, Hideharu; Nakagawa, Hiroyuki; Tsuchiya, Tatsuhiro Finding minimum locating arrays using a CSP solver. (English) Zbl 1471.68070 Fundam. Inform. 174, No. 1, 27-42 (2020). MSC: 68N30 05B40 68R07 68T20 PDF BibTeX XML Cite \textit{T. Konishi} et al., Fundam. Inform. 174, No. 1, 27--42 (2020; Zbl 1471.68070) Full Text: DOI arXiv OpenURL
Zhuk, Dmitriy A proof of the CSP dichotomy conjecture. (English) Zbl 07273097 J. ACM 67, No. 5, Article No. 30, 78 p. (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{D. Zhuk}, J. ACM 67, No. 5, Article No. 30, 78 p. (2020; Zbl 07273097) Full Text: DOI arXiv OpenURL
Matl, Gregor; Živný, Stanislav Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs. (English) Zbl 07272771 Algorithmica 82, No. 12, 3492-3520 (2020). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{G. Matl} and \textit{S. Živný}, Algorithmica 82, No. 12, 3492--3520 (2020; Zbl 07272771) Full Text: DOI arXiv OpenURL
Ortiz, Luis E. On sparse discretization for graphical games. (English) Zbl 07269301 J. Artif. Intell. Res. (JAIR) 69, 67-84 (2020). MSC: 91-XX PDF BibTeX XML Cite \textit{L. E. Ortiz}, J. Artif. Intell. Res. (JAIR) 69, 67--84 (2020; Zbl 07269301) Full Text: DOI arXiv OpenURL
Esterhuizen, Willem; Aschenbruck, Tim; Streif, Stefan On maximal robust positively invariant sets in constrained nonlinear systems. (English) Zbl 1451.93070 Automatica 119, Article ID 109044, 4 p. (2020). MSC: 93B35 93B03 93C10 PDF BibTeX XML Cite \textit{W. Esterhuizen} et al., Automatica 119, Article ID 109044, 4 p. (2020; Zbl 1451.93070) Full Text: DOI arXiv OpenURL
Omrani, Mohamed Amine; Naanaa, Wady Constraints for generating graphs with imposed and forbidden patterns: an application to molecular graphs. (English) Zbl 1477.68244 Constraints 25, No. 1-2, 1-22 (2020). MSC: 68R10 05C92 90C27 90C35 PDF BibTeX XML Cite \textit{M. A. Omrani} and \textit{W. Naanaa}, Constraints 25, No. 1--2, 1--22 (2020; Zbl 1477.68244) Full Text: DOI OpenURL
Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid Best-case and worst-case sparsifiability of Boolean CSPs. (English) Zbl 1452.68176 Algorithmica 82, No. 8, 2200-2242 (2020). MSC: 68T20 68Q17 68Q27 68R07 PDF BibTeX XML Cite \textit{H. Chen} et al., Algorithmica 82, No. 8, 2200--2242 (2020; Zbl 1452.68176) Full Text: DOI Link 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
Bodirsky, Manuel; Vucaj, Albert Two-element structures modulo primitive positive constructability. (English) Zbl 1477.08003 Algebra Univers. 81, No. 2, Paper No. 20, 17 p. (2020). MSC: 08A40 08A70 08B05 68Q17 PDF BibTeX XML Cite \textit{M. Bodirsky} and \textit{A. Vucaj}, Algebra Univers. 81, No. 2, Paper No. 20, 17 p. (2020; Zbl 1477.08003) Full Text: DOI arXiv OpenURL
Barto, Libor; Pinsker, Michael Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). (English) Zbl 1432.68169 SIAM J. Comput. 49, No. 2, 365-393 (2020). MSC: 68Q25 03C05 03C35 08A70 68Q17 68Q27 68R07 PDF BibTeX XML Cite \textit{L. Barto} and \textit{M. Pinsker}, SIAM J. Comput. 49, No. 2, 365--393 (2020; Zbl 1432.68169) Full Text: DOI arXiv OpenURL
Butti, Silvia; Živný, Stanislav Sparsification of binary CSPs. (English) Zbl 1432.68173 SIAM J. Discrete Math. 34, No. 1, 825-842 (2020). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{S. Butti} and \textit{S. Živný}, SIAM J. Discrete Math. 34, No. 1, 825--842 (2020; Zbl 1432.68173) Full Text: DOI arXiv OpenURL
Backens, Miriam; Bulatov, Andrei; Goldberg, Leslie Ann; McQuillan, Colin; Živný, Stanislav Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. (English) Zbl 1435.68221 J. Comput. Syst. Sci. 109, 95-125 (2020). MSC: 68R05 68Q17 68Q25 68R07 82D40 PDF BibTeX XML Cite \textit{M. Backens} et al., J. Comput. Syst. Sci. 109, 95--125 (2020; Zbl 1435.68221) Full Text: DOI arXiv OpenURL
Guo, Heng; Williams, Tyson The complexity of planar Boolean #CSP with complex weights. (English) Zbl 1436.68135 J. Comput. Syst. Sci. 107, 1-27 (2020). MSC: 68Q25 68Q17 68R07 68R10 PDF BibTeX XML Cite \textit{H. Guo} and \textit{T. Williams}, J. Comput. Syst. Sci. 107, 1--27 (2020; Zbl 1436.68135) Full Text: DOI arXiv OpenURL
Alaoui, Ahmed El; Ramdas, Aaditya; Krzakala, Florent; Zdeborová, Lenka; Jordan, Michael I. Decoding from pooled data: sharp information-theoretic bounds. (English) Zbl 07468825 SIAM J. Math. Data Sci. 1, No. 1, 161-188 (2019). MSC: 60C05 60F10 60K35 PDF BibTeX XML Cite \textit{A. E. Alaoui} et al., SIAM J. Math. Data Sci. 1, No. 1, 161--188 (2019; Zbl 07468825) Full Text: DOI arXiv OpenURL
Chen, Hubie; Jansen, Bart M. P.; Pieterse, Astrid Best-case and worst-case sparsifiability of Boolean CSPs. (English) Zbl 07378601 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 15, 13 p. (2019). MSC: 68Q25 68Wxx PDF BibTeX XML Cite \textit{H. Chen} et al., LIPIcs -- Leibniz Int. Proc. Inform. 115, Article 15, 13 p. (2019; Zbl 07378601) Full Text: DOI arXiv OpenURL
Bergenti, Federico; Monica, Stefania A subdivision algorithm to reason on high-degree polynomial constraints over finite domains. (English) Zbl 1474.68323 Ann. Math. Artif. Intell. 87, No. 4, 343-360 (2019). MSC: 68T20 68T27 PDF BibTeX XML Cite \textit{F. Bergenti} and \textit{S. Monica}, Ann. Math. Artif. Intell. 87, No. 4, 343--360 (2019; Zbl 1474.68323) Full Text: DOI OpenURL
Barto, Libor Algebraic theory of promise constraint satisfaction problems, first steps. (English) Zbl 07160823 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, 3-17 (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Barto}, Lect. Notes Comput. Sci. 11651, 3--17 (2019; Zbl 07160823) Full Text: DOI arXiv OpenURL
Bulín, Jakub; Krokhin, Andrei; Opršal, Jakub Algebraic approach to promise constraint satisfaction. (English) Zbl 1433.68271 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). 602-613 (2019). MSC: 68R07 05C15 68Q17 68Q25 PDF BibTeX XML Cite \textit{J. Bulín} 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). 602--613 (2019; Zbl 1433.68271) Full Text: DOI arXiv OpenURL
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 arXiv OpenURL
Brakensiek, Joshua; Guruswami, Venkatesan Bridging between 0/1 and linear programming via random walks. (English) Zbl 1433.68156 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). 568-577 (2019). MSC: 68Q17 68R07 68W20 90C05 90C10 90C15 PDF BibTeX XML Cite \textit{J. Brakensiek} and \textit{V. Guruswami}, 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). 568--577 (2019; Zbl 1433.68156) Full Text: DOI arXiv OpenURL
Potechin, Aaron On the approximation resistance of balanced linear threshold functions. (English) Zbl 1433.68160 Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 430-441 (2019). MSC: 68Q17 PDF BibTeX XML Cite \textit{A. Potechin}, 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). 430--441 (2019; Zbl 1433.68160) Full Text: DOI arXiv OpenURL
Du, Yonghao; Xing, Lining; Chen, Yingguo; Xiang, Shang Unified modeling and multi-strategy collaborative optimization for satellite task scheduling. (Chinese. English summary) Zbl 1463.90064 Control Decis. 34, No. 9, 1847-1856 (2019). MSC: 90B35 PDF BibTeX XML Cite \textit{Y. Du} et al., Control Decis. 34, No. 9, 1847--1856 (2019; Zbl 1463.90064) Full Text: DOI OpenURL
Dvořák, Zdeněk; Norin, Sergey; Postle, Luke List coloring with requests. (English) Zbl 1429.05064 J. Graph Theory 92, No. 3, 191-206 (2019). MSC: 05C15 PDF BibTeX XML Cite \textit{Z. Dvořák} et al., J. Graph Theory 92, No. 3, 191--206 (2019; Zbl 1429.05064) Full Text: DOI arXiv OpenURL
Nguyen, Tam Willy; Catoire, Laurent; Garone, Emanuele Control of a quadrotor and a ground vehicle manipulating an object. (English) Zbl 1429.93250 Automatica 105, 384-390 (2019). MSC: 93C85 93D20 93C10 PDF BibTeX XML Cite \textit{T. W. Nguyen} et al., Automatica 105, 384--390 (2019; Zbl 1429.93250) Full Text: DOI arXiv OpenURL
Jansen, Bart M. P.; Pieterse, Astrid Optimal sparsification for some binary CSPs using low-degree polynomials. (English) Zbl 07143744 ACM Trans. Comput. Theory 11, No. 4, Article No. 28, 26 p. (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{B. M. P. Jansen} and \textit{A. Pieterse}, ACM Trans. Comput. Theory 11, No. 4, Article No. 28, 26 p. (2019; Zbl 07143744) Full Text: DOI Link OpenURL
Fulla, Peter; Uppman, Hannes; Živný, Stanislav The complexity of Boolean surjective general-valued CSPs. (English) Zbl 1441.68091 ACM Trans. Comput. Theory 11, No. 1, Article No. 4, 31 p. (2019). MSC: 68Q25 68Q17 68R07 90C09 PDF BibTeX XML Cite \textit{P. Fulla} et al., ACM Trans. Comput. Theory 11, No. 1, Article No. 4, 31 p. (2019; Zbl 1441.68091) Full Text: DOI arXiv Link OpenURL
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68190 ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019). MSC: 68R10 05C20 05C60 08A70 68Q17 68Q25 PDF BibTeX XML Cite \textit{B. Larose} et al., ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019; Zbl 1485.68190) Full Text: DOI arXiv Link OpenURL
Dalmau, Víctor; Kozik, Marcin; Krokhin, Andrei; Makarychev, Konstantin; Makarychev, Yury; Opršal, Jakub Robust algorithms with polynomial loss for near-unanimity CSPs. (English) Zbl 1452.68087 SIAM J. Comput. 48, No. 6, 1763-1795 (2019). MSC: 68Q25 68Q17 68T20 68W20 68W25 68W40 PDF BibTeX XML Cite \textit{V. Dalmau} et al., SIAM J. Comput. 48, No. 6, 1763--1795 (2019; Zbl 1452.68087) Full Text: DOI arXiv OpenURL
Beierle, Christoph; Kutsch, Steven; Sauerwald, Kai Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations. (English) Zbl 1452.68179 Ann. Math. Artif. Intell. 87, No. 1-2, 5-41 (2019). MSC: 68T27 68T30 68T35 68T37 PDF BibTeX XML Cite \textit{C. Beierle} et al., Ann. Math. Artif. Intell. 87, No. 1--2, 5--41 (2019; Zbl 1452.68179) Full Text: DOI OpenURL
Barto, Libor; Kompatscher, Michael; Olšák, Miroslav; Pham, Trung Van; Pinsker, Michael Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures. (English) Zbl 1477.03118 J. Math. Log. 19, No. 2, Article ID 1950010, 31 p. (2019). MSC: 03C05 08A40 03C35 03C40 08B05 68Q17 20B27 PDF BibTeX XML Cite \textit{L. Barto} et al., J. Math. Log. 19, No. 2, Article ID 1950010, 31 p. (2019; Zbl 1477.03118) Full Text: DOI arXiv OpenURL
Hirai, Hiroshi; Iwamasa, Yuni; Murota, Kazuo; Živný, Stanislav A tractable class of binary VCSPs via M-convex intersection. (English) Zbl 1454.68058 ACM Trans. Algorithms 15, No. 3, Article No. 44, 41 p. (2019). MSC: 68Q27 90C27 PDF BibTeX XML Cite \textit{H. Hirai} et al., ACM Trans. Algorithms 15, No. 3, Article No. 44, 41 p. (2019; Zbl 1454.68058) Full Text: DOI arXiv Link OpenURL
Goto, Hiroyuki; Murray, Alan T. Small-\(m\) method for detecting all longest paths. (English) Zbl 07119072 Opsearch 56, No. 3, 824-839 (2019). MSC: 90C35 90C11 90B10 PDF BibTeX XML Cite \textit{H. Goto} and \textit{A. T. Murray}, Opsearch 56, No. 3, 824--839 (2019; Zbl 07119072) Full Text: DOI OpenURL
Cárdenas-Viedma, M. A.; Marín, R. FTClogic: fuzzy temporal constraint logic. (English) Zbl 1423.03076 Fuzzy Sets Syst. 363, 84-112 (2019). MSC: 03B52 03B44 03B70 68T37 PDF BibTeX XML Cite \textit{M. A. Cárdenas-Viedma} and \textit{R. Marín}, Fuzzy Sets Syst. 363, 84--112 (2019; Zbl 1423.03076) Full Text: DOI OpenURL
Davarnia, Danial; Hooker, J. N. Consistency for \(0-1\) programming. (English) Zbl 07116696 Rousseau, Louis-Martin (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11494, 225-240 (2019). MSC: 68T20 90C27 PDF BibTeX XML Cite \textit{D. Davarnia} and \textit{J. N. Hooker}, Lect. Notes Comput. Sci. 11494, 225--240 (2019; Zbl 07116696) Full Text: DOI arXiv OpenURL
Bulatov, Andrei A. Constraint satisfaction problems over semilattice block Mal’tsev algebras. (English) Zbl 1434.68191 Inf. Comput. 268, Article ID 104437, 14 p. (2019). MSC: 68Q25 08B05 68R07 PDF BibTeX XML Cite \textit{A. A. Bulatov}, Inf. Comput. 268, Article ID 104437, 14 p. (2019; Zbl 1434.68191) Full Text: DOI arXiv OpenURL
Behrisch, Mike; Hermann, Miki; Mengel, Stefan; Salzer, Gernot Minimal distance of propositional models. (English) Zbl 1430.68120 Theory Comput. Syst. 63, No. 6, 1131-1184 (2019). MSC: 68Q25 03B05 68Q17 68R07 68W40 PDF BibTeX XML Cite \textit{M. Behrisch} et al., Theory Comput. Syst. 63, No. 6, 1131--1184 (2019; Zbl 1430.68120) Full Text: DOI arXiv OpenURL
Bodirsky, Manuel; Martin, Barnaby; Pinsker, Michael; Pongrácz, András Constraint satisfaction problems for reducts of homogeneous graphs. (English) Zbl 1430.68121 SIAM J. Comput. 48, No. 4, 1224-1264 (2019). MSC: 68Q25 03C15 05C55 05C75 08A70 PDF BibTeX XML Cite \textit{M. Bodirsky} et al., SIAM J. Comput. 48, No. 4, 1224--1264 (2019; Zbl 1430.68121) Full Text: DOI OpenURL
Chen, Hubie; Valeriote, Matt; Yoshida, Yuichi Constant-query testability of assignments to constraint satisfaction problems. (English) Zbl 1430.68439 SIAM J. Comput. 48, No. 3, 1022-1045 (2019). MSC: 68W20 08A02 08A70 68R07 PDF BibTeX XML Cite \textit{H. Chen} et al., SIAM J. Comput. 48, No. 3, 1022--1045 (2019; Zbl 1430.68439) Full Text: DOI OpenURL
Zhuk, Dmitriy The size of generating sets of powers. (English) Zbl 07094557 J. Comb. Theory, Ser. A 167, 91-103 (2019). MSC: 68-XX PDF BibTeX XML Cite \textit{D. Zhuk}, J. Comb. Theory, Ser. A 167, 91--103 (2019; Zbl 07094557) Full Text: DOI arXiv OpenURL
Atserias, Albert; Kolaitis, Phokion G.; Severini, Simone Generalized satisfiability problems via operator assignments. (English) Zbl 1423.68430 J. Comput. Syst. Sci. 105, 171-198 (2019). MSC: 68T20 47B99 81P68 PDF BibTeX XML Cite \textit{A. Atserias} et al., J. Comput. Syst. Sci. 105, 171--198 (2019; Zbl 1423.68430) Full Text: DOI arXiv OpenURL
Álvarez, V.; Armario, J. A.; Falcón, R. M.; Frau, M. D.; Gudiel, F.; Güemes, M. B.; Osuna, A. Generating binary partial Hadamard matrices. (English) Zbl 1414.05059 Discrete Appl. Math. 263, 2-7 (2019). MSC: 05B20 PDF BibTeX XML Cite \textit{V. Álvarez} et al., Discrete Appl. Math. 263, 2--7 (2019; Zbl 1414.05059) Full Text: DOI OpenURL
Hadfield, Stuart; Wang, Zhihui; O’Gorman, Bryan; Rieffel, Eleanor G.; Venturelli, Davide; Biswas, Rupak From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. (English) Zbl 1461.68085 Algorithms (Basel) 12, No. 2, Paper No. 34, 45 p. (2019). MSC: 68Q12 81P65 81P68 90C27 PDF BibTeX XML Cite \textit{S. Hadfield} et al., Algorithms (Basel) 12, No. 2, Paper No. 34, 45 p. (2019; Zbl 1461.68085) Full Text: DOI arXiv OpenURL
Selezneva, Svetlana N. On bijunctive predicates over a finite set. (English. Russian original) Zbl 1410.68149 Discrete Math. Appl. 29, No. 1, 49-58 (2019); translation from Diskretn. Mat. 29, No. 4, 130-142 (2017). MSC: 68Q19 68Q25 PDF BibTeX XML Cite \textit{S. N. Selezneva}, Discrete Math. Appl. 29, No. 1, 49--58 (2019; Zbl 1410.68149); translation from Diskretn. Mat. 29, No. 4, 130--142 (2017) Full Text: DOI OpenURL
Shahraeeni, Mohammad Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping. (English) Zbl 1411.86012 Math. Geosci. 51, No. 2, 155-186 (2019); correction ibid. 51, No. 2, 265 (2019). MSC: 86A32 PDF BibTeX XML Cite \textit{M. Shahraeeni}, Math. Geosci. 51, No. 2, 155--186 (2019; Zbl 1411.86012) Full Text: DOI OpenURL