Barsukov, Alexey; Madelaine, Florent R. On guarded extensions of MMSNP. (English) Zbl 07787582 Della Vedova, Gianluca (ed.) et al., Unity of logic and computation. 19th conference on computability in Europe, CiE 2023, Batumi, Georgia, July 24–28, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13967, 202-213 (2023). MSC: 03B70 68Qxx PDFBibTeX XMLCite \textit{A. Barsukov} and \textit{F. R. Madelaine}, Lect. Notes Comput. Sci. 13967, 202--213 (2023; Zbl 07787582) Full Text: DOI arXiv
Chawin, Dror; Haviv, Ishay Improved NP-hardness of approximation for orthogonality dimension and minrank. (English) Zbl 1527.05060 SIAM J. Discrete Math. 37, No. 4, 2670-2688 (2023). MSC: 05C15 05C20 03D15 05C50 68Q25 PDFBibTeX XMLCite \textit{D. Chawin} and \textit{I. Haviv}, SIAM J. Discrete Math. 37, No. 4, 2670--2688 (2023; Zbl 1527.05060) Full Text: DOI arXiv
Přenosil, Adam The lattice of super-Belnap logics. (English) Zbl 07658883 Rev. Symb. Log. 16, No. 1, 114-163 (2023). MSC: 03G27 03G10 03C05 PDFBibTeX XMLCite \textit{A. Přenosil}, Rev. Symb. Log. 16, No. 1, 114--163 (2023; Zbl 07658883) Full Text: DOI arXiv
Zhang, Jing Some remarks on uncountable rainbow Ramsey theory. (English) Zbl 07630934 Proc. Am. Math. Soc. 151, No. 2, 865-880 (2023). MSC: 03E02 03E35 03E55 PDFBibTeX XMLCite \textit{J. Zhang}, Proc. Am. Math. Soc. 151, No. 2, 865--880 (2023; Zbl 07630934) Full Text: DOI arXiv
Kazda, Alexandr; Mayr, Peter; Zhuk, Dmitriy Small promise CSPs that reduce to large CSPs. (English) Zbl 07596573 Log. Methods Comput. Sci. 18, No. 3, Paper No. 25, 14 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{A. Kazda} et al., Log. Methods Comput. Sci. 18, No. 3, Paper No. 25, 14 p. (2022; Zbl 07596573) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{C. Carbonnel} et al., SIAM J. Comput. 51, No. 1, 19--69 (2022; Zbl 07470541) Full Text: DOI arXiv
Berg, Kevin M. The complexity of homomorphism factorization. (English) Zbl 1518.68141 Algebra Univers. 82, No. 3, Paper No. 47, 19 p. (2021). MSC: 68Q25 03C05 03C13 08A05 68Q17 PDFBibTeX XMLCite \textit{K. M. Berg}, Algebra Univers. 82, No. 3, Paper No. 47, 19 p. (2021; Zbl 1518.68141) Full Text: DOI arXiv Backlinks: MO
Nešetřil, Jaroslav; Ossona de Mendez, Patrice A unified approach to structural limits and limits of graphs with bounded tree-depth. (English) Zbl 1491.03004 Memoirs of the American Mathematical Society 1272. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4065-7/pbk; 978-1-4704-5652-8/ebook). v, 108 p. (2020). Reviewer: Vera Koponen (Uppsala) MSC: 03-02 03C13 03C98 05C99 06E15 28C05 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{P. Ossona de Mendez}, A unified approach to structural limits and limits of graphs with bounded tree-depth. Providence, RI: American Mathematical Society (AMS) (2020; Zbl 1491.03004) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{L. Barto} and \textit{M. Pinsker}, SIAM J. Comput. 49, No. 2, 365--393 (2020; Zbl 1432.68169) Full Text: DOI arXiv
Abramsky, Samson Whither semantics? (English) Zbl 1506.03078 Theor. Comput. Sci. 807, 3-14 (2020). MSC: 03C13 18C50 PDFBibTeX XMLCite \textit{S. Abramsky}, Theor. Comput. Sci. 807, 3--14 (2020; Zbl 1506.03078) Full Text: DOI arXiv
Bova, Simone; Chen, Hubie How many variables are needed to express an existential positive query? (English) Zbl 1430.68079 Theory Comput. Syst. 63, No. 7, 1573-1594 (2019). MSC: 68P15 03B70 PDFBibTeX XMLCite \textit{S. Bova} and \textit{H. Chen}, Theory Comput. Syst. 63, No. 7, 1573--1594 (2019; Zbl 1430.68079) Full Text: DOI Link
Behrisch, Mike; Vargas-García, Edith; Zhuk, Dmitriy The number of clones determined by disjunctions of unary relations. (English) Zbl 1484.08003 Theory Comput. Syst. 63, No. 6, 1298-1313 (2019). MSC: 08A40 03B50 08A02 68Q25 PDFBibTeX XMLCite \textit{M. Behrisch} et al., Theory Comput. Syst. 63, No. 6, 1298--1313 (2019; Zbl 1484.08003) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., SIAM J. Comput. 48, No. 4, 1224--1264 (2019; Zbl 1430.68121) Full Text: DOI
Abramsky, Samson; Shah, Nihil Relating structure and power: comonadic semantics for computational resources. (English) Zbl 1509.03098 Ghica, Dan R. (ed.) et al., 27th EACSL annual conference on computer science logic, CSL 2018, Birmingham, United Kingdom, September 4–8, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 119, Article 2, 17 p. (2018). MSC: 03C13 18C15 18C50 PDFBibTeX XMLCite \textit{S. Abramsky} and \textit{N. Shah}, LIPIcs -- Leibniz Int. Proc. Inform. 119, Article 2, 17 p. (2018; Zbl 1509.03098) Full Text: DOI
Madelaine, Florent R.; Martin, Barnaby Consistency for counting quantifiers. (English) Zbl 1510.68031 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{F. R. Madelaine} and \textit{B. Martin}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 11, 13 p. (2018; Zbl 1510.68031) Full Text: DOI
Džamonja, Mirna; Panza, Marco Asymptotic quasi-completeness and ZFC. (English) Zbl 1439.03085 Carnielli, Walter (ed.) et al., Contradictions, from consistency to inconsistency. Cham: Springer. Trends Log. Stud. Log. Libr. 47, 159-182 (2018). MSC: 03E30 03A05 PDFBibTeX XMLCite \textit{M. Džamonja} and \textit{M. Panza}, Trends Log. Stud. Log. Libr. 47, 159--182 (2018; Zbl 1439.03085) Full Text: DOI Link
Koponen, Vera On constraints and dividing in ternary homogeneous structures. (English) Zbl 1477.03142 J. Symb. Log. 83, No. 4, 1691-1721 (2018). MSC: 03C50 03C10 03C45 03C13 03C15 03C30 PDFBibTeX XMLCite \textit{V. Koponen}, J. Symb. Log. 83, No. 4, 1691--1721 (2018; Zbl 1477.03142) Full Text: DOI arXiv
Abramsky, Samson; Shah, Nihil Relating structure and power: comonadic semantics for computational resources (extended abstract). (English) Zbl 1509.03096 Cîrstea, Corina (ed.), Coalgebraic methods in computer science. 14th IFIP WG 1.3 international workshop, CMCS 2018, colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 11202, 1-5 (2018). MSC: 03C13 18C15 18C50 PDFBibTeX XMLCite \textit{S. Abramsky} and \textit{N. Shah}, Lect. Notes Comput. Sci. 11202, 1--5 (2018; Zbl 1509.03096) Full Text: DOI arXiv
Thinniyam, Ramanathan S. Defining recursive predicates in graph orders. (English) Zbl 1515.03167 Log. Methods Comput. Sci. 14, No. 3, Paper No. 21, 38 p. (2018). MSC: 03C57 03C13 03C40 03C65 68Q19 PDFBibTeX XMLCite \textit{R. S. Thinniyam}, Log. Methods Comput. Sci. 14, No. 3, Paper No. 21, 38 p. (2018; Zbl 1515.03167) Full Text: DOI arXiv
Ham, Lucy; Jackson, Marcel Axiomatisability and hardness for universal Horn classes of hypergraphs. (English) Zbl 1522.08003 Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018). MSC: 08C15 05C65 05C60 68Q17 03C13 PDFBibTeX XMLCite \textit{L. Ham} and \textit{M. Jackson}, Algebra Univers. 79, No. 2, Paper No. 30, 17 p. (2018; Zbl 1522.08003) Full Text: DOI arXiv
Day, Adam R.; Marks, Andrew S. Jump operations for Borel graphs. (English) Zbl 1447.03011 J. Symb. Log. 83, No. 1, 13-28 (2018). MSC: 03E15 03D60 PDFBibTeX XMLCite \textit{A. R. Day} and \textit{A. S. Marks}, J. Symb. Log. 83, No. 1, 13--28 (2018; Zbl 1447.03011) Full Text: DOI arXiv
Guerrini, Stefano; Solieri, Marco Is the optimal implementation inefficient? Elementarily not. (English) Zbl 1434.68087 Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 17, 16 p. (2017). MSC: 68N18 03B40 03F05 03F52 PDFBibTeX XMLCite \textit{S. Guerrini} and \textit{M. Solieri}, LIPIcs -- Leibniz Int. Proc. Inform. 84, Article 17, 16 p. (2017; Zbl 1434.68087) Full Text: DOI
Koponen, Vera Homogeneous 1-based structures and interpretability in random structures. (English) Zbl 1469.03089 Math. Log. Q. 63, No. 1-2, 6-18 (2017). MSC: 03C13 60C05 03C45 PDFBibTeX XMLCite \textit{V. Koponen}, Math. Log. Q. 63, No. 1--2, 6--18 (2017; Zbl 1469.03089) Full Text: DOI arXiv
Rossman, Benjamin An improved homomorphism preservation theorem from lower bounds in circuit complexity. (English) Zbl 1402.68077 Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 27, 17 p. (2017). MSC: 68Q19 03C07 03C13 03C40 68R10 PDFBibTeX XMLCite \textit{B. Rossman}, LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 27, 17 p. (2017; Zbl 1402.68077) Full Text: DOI arXiv
Glaßer, Christian; Jonsson, Peter; Martin, Barnaby Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1380.68221 Theor. Comput. Sci. 703, 18-36 (2017). MSC: 68Q25 03F30 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Theor. Comput. Sci. 703, 18--36 (2017; Zbl 1380.68221) Full Text: DOI Link
Martin, Barnaby; Pongrácz, András; Wrona, Michał The complexity of counting quantifiers on equality languages. (English) Zbl 1359.68138 Theor. Comput. Sci. 670, 56-67 (2017). MSC: 68Q25 03B70 PDFBibTeX XMLCite \textit{B. Martin} et al., Theor. Comput. Sci. 670, 56--67 (2017; Zbl 1359.68138) Full Text: DOI Link
Martin, Barnaby; Pongrácz, András; Wrona, Michał The complexity of counting quantifiers on equality languages. (English) Zbl 1476.68113 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 333-342 (2016). MSC: 68Q25 03B70 PDFBibTeX XMLCite \textit{B. Martin} et al., Lect. Notes Comput. Sci. 9709, 333--342 (2016; Zbl 1476.68113) Full Text: DOI Link
Glaßer, Christian; Jonsson, Peter; Martin, Barnaby Circuit satisfiability and constraint satisfaction around Skolem arithmetic. (English) Zbl 1475.68123 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 323-332 (2016). MSC: 68Q06 03B25 03F30 68Q25 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Lect. Notes Comput. Sci. 9709, 323--332 (2016; Zbl 1475.68123) Full Text: DOI Link
Bodirsky, Manuel; Dalmau, Victor; Martin, Barnaby; Mottet, Antoine; Pinsker, Michael Distance constraint satisfaction problems. (English) Zbl 1336.68116 Inf. Comput. 247, 87-105 (2016). MSC: 68Q25 03B70 68Q17 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Inf. Comput. 247, 87--105 (2016; Zbl 1336.68116) Full Text: DOI arXiv
Koponen, Vera Binary simple homogeneous structures are supersimple with finite rank. (English) Zbl 1352.03044 Proc. Am. Math. Soc. 144, No. 4, 1745-1759 (2016). Reviewer: Isaac Goldbring (Irvine) MSC: 03C10 03C45 03C50 03C52 03C68 PDFBibTeX XMLCite \textit{V. Koponen}, Proc. Am. Math. Soc. 144, No. 4, 1745--1759 (2016; Zbl 1352.03044) Full Text: DOI arXiv
Kazda, Alexandr CSP for binary conservative relational structures. (English) Zbl 1356.08001 Algebra Univers. 75, No. 1, 75-84 (2016). Reviewer: Jakub Bulín (Boulder) MSC: 08A02 03C05 08A30 68R05 68T20 PDFBibTeX XMLCite \textit{A. Kazda}, Algebra Univers. 75, No. 1, 75--84 (2016; Zbl 1356.08001) Full Text: DOI arXiv
Sankaran, Abhisekh; Adsul, Bharat; Chakraborty, Supratik A generalization of the Łoś-Tarski preservation theorem. (English) Zbl 1353.03019 Ann. Pure Appl. Logic 167, No. 3, 189-210 (2016). Reviewer: Daniele Mundici (Firenze) MSC: 03C40 03C52 03C75 03C13 PDFBibTeX XMLCite \textit{A. Sankaran} et al., Ann. Pure Appl. Logic 167, No. 3, 189--210 (2016; Zbl 1353.03019) Full Text: DOI arXiv
Bodirsky, Manuel; Martin, Barnaby; Mottet, Antoine Constraint satisfaction problems over the integers with successor. (English) Zbl 1440.68111 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 256-267 (2015). MSC: 68Q25 03B70 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Lect. Notes Comput. Sci. 9134, 256--267 (2015; Zbl 1440.68111) Full Text: DOI arXiv Link
Bova, Simone; Chen, Hubie The complexity of equivalence, entailment, and minimization in existential positive logic. (English) Zbl 1401.03030 J. Comput. Syst. Sci. 81, No. 2, 443-457 (2015). MSC: 03B20 03D15 68Q17 PDFBibTeX XMLCite \textit{S. Bova} and \textit{H. Chen}, J. Comput. Syst. Sci. 81, No. 2, 443--457 (2015; Zbl 1401.03030) Full Text: DOI
Chen, Hubie An algebraic hardness criterion for surjective constraint satisfaction. (English) Zbl 1308.08001 Algebra Univers. 72, No. 4, 393-401 (2014). Reviewer: Ivan Chajda (Přerov) MSC: 08A70 03C05 68Q17 PDFBibTeX XMLCite \textit{H. Chen}, Algebra Univers. 72, No. 4, 393--401 (2014; Zbl 1308.08001) Full Text: DOI arXiv
Chen, Hubie On the complexity of existential positive queries. (English) Zbl 1288.68161 ACM Trans. Comput. Log. 15, No. 1, Article No. 9, 20 p. (2014). MSC: 68Q60 03B20 68Q17 68Q25 PDFBibTeX XMLCite \textit{H. Chen}, ACM Trans. Comput. Log. 15, No. 1, Article No. 9, 20 p. (2014; Zbl 1288.68161) Full Text: DOI arXiv Link
Palumbo, Justin Comparisons of polychromatic and monochromatic Ramsey theory. (English) Zbl 1345.03088 J. Symb. Log. 78, No. 3, 951-968 (2013). MSC: 03E02 03E05 05D10 PDFBibTeX XMLCite \textit{J. Palumbo}, J. Symb. Log. 78, No. 3, 951--968 (2013; Zbl 1345.03088) Full Text: DOI arXiv Euclid
Bulian, Jannis; Hodkinson, Ian Bare canonicity of representable cylindric and polyadic algebras. (English) Zbl 1321.03077 Ann. Pure Appl. Logic 164, No. 9, 884-906 (2013). Reviewer: Miklós Ferenczi (Budapest) MSC: 03G15 03G27 03C05 06E25 05C90 PDFBibTeX XMLCite \textit{J. Bulian} and \textit{I. Hodkinson}, Ann. Pure Appl. Logic 164, No. 9, 884--906 (2013; Zbl 1321.03077) Full Text: DOI arXiv
Yang, Yan; Liu, Qing-you; Wang, Xue-ping Decomposition of realizable fuzzy relations. (English) Zbl 1269.03054 Soft Comput. 17, No. 3, 363-367 (2013). Reviewer: Salvatore Sessa (Napoli) MSC: 03E72 05C15 PDFBibTeX XMLCite \textit{Y. Yang} et al., Soft Comput. 17, No. 3, 363--367 (2013; Zbl 1269.03054) Full Text: DOI
Nešetřil, Jaroslav; Ossona de Mendez, Patrice First order properties on nowhere dense structures. (English) Zbl 1206.03033 J. Symb. Log. 75, No. 3, 868-887 (2010). Reviewer: Vera Koponen (Uppsala) MSC: 03C13 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{P. Ossona de Mendez}, J. Symb. Log. 75, No. 3, 868--887 (2010; Zbl 1206.03033) Full Text: DOI Link
Csima, Barbara F.; Mileti, Joseph R. The strength of the rainbow Ramsey theorem. (English) Zbl 1188.03044 J. Symb. Log. 74, No. 4, 1310-1324 (2009). Reviewer: Jeffry L. Hirst (Boone) MSC: 03F35 03B30 03D32 03D80 05D10 PDFBibTeX XMLCite \textit{B. F. Csima} and \textit{J. R. Mileti}, J. Symb. Log. 74, No. 4, 1310--1324 (2009; Zbl 1188.03044) Full Text: DOI
Bodirsky, Manuel; Chen, Hubie; Kára, Jan; von Oertzen, Timo Maximal infinite-valued constraint languages. (English) Zbl 1172.68052 Theor. Comput. Sci. 410, No. 18, 1684-1693 (2009). MSC: 68T20 03C35 08A70 68Q25 PDFBibTeX XMLCite \textit{M. Bodirsky} et al., Theor. Comput. Sci. 410, No. 18, 1684--1693 (2009; Zbl 1172.68052) Full Text: DOI
Hella, Lauri; Sevenster, Merlijn; Tulenheimo, Tero Partially ordered connectives and monadic monotone strict NP. (English) Zbl 1169.03023 J. Logic Lang. Inf. 17, No. 3, 323-344 (2008). MSC: 03B70 03C80 03D15 68Q15 68Q25 PDFBibTeX XMLCite \textit{L. Hella} et al., J. Logic Lang. Inf. 17, No. 3, 323--344 (2008; Zbl 1169.03023) Full Text: DOI
Bodirsky, Manuel Constraint satisfaction problems with infinite templates. (English) Zbl 1171.03320 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 196-228 (2008). MSC: 03B70 08A70 PDFBibTeX XMLCite \textit{M. Bodirsky}, Lect. Notes Comput. Sci. 5250, 196--228 (2008; Zbl 1171.03320) Full Text: DOI
Kolaitis, Phokion G.; Vardi, Moshe Y. A logical approach to constraint satisfaction. (English) Zbl 1171.03322 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 125-155 (2008). MSC: 03B70 68Q25 68P15 68T20 PDFBibTeX XMLCite \textit{P. G. Kolaitis} and \textit{M. Y. Vardi}, Lect. Notes Comput. Sci. 5250, 125--155 (2008; Zbl 1171.03322) Full Text: DOI
Bulatov, Andrei A.; Krokhin, Andrei; Larose, Benoit Dualities for constraint satisfaction problems. (English) Zbl 1171.68494 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 93-124 (2008). MSC: 68Q25 03B70 08A70 PDFBibTeX XMLCite \textit{A. A. Bulatov} et al., Lect. Notes Comput. Sci. 5250, 93--124 (2008; Zbl 1171.68494) Full Text: DOI
Bulatov, Andrei A.; Valeriote, Matthew A. Recent results on the algebraic approach to the CSP. (English) Zbl 1171.08300 Creignou, Nadia (ed.) et al., Complexity of constraints. An overview of current research themes. Berlin: Springer (ISBN 978-3-540-92799-0/pbk). Lecture Notes in Computer Science 5250, 68-92 (2008). MSC: 08A70 03B70 PDFBibTeX XMLCite \textit{A. A. Bulatov} and \textit{M. A. Valeriote}, Lect. Notes Comput. Sci. 5250, 68--92 (2008; Zbl 1171.08300) Full Text: DOI
Martin, Barnaby First-order model checking problems parameterized by the model. (English) Zbl 1142.68439 Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 417-427 (2008). MSC: 68Q60 03B70 PDFBibTeX XMLCite \textit{B. Martin}, Lect. Notes Comput. Sci. 5028, 417--427 (2008; Zbl 1142.68439) Full Text: DOI
Khoussainov, Bakhadyr; Liu, Jiamou; Minnes, Mia Unary automatic graphs: An algorithmic perspective. (English) Zbl 1139.03313 Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 542-553 (2008). MSC: 03D05 68Q45 68R10 PDFBibTeX XMLCite \textit{B. Khoussainov} et al., Lect. Notes Comput. Sci. 4978, 542--553 (2008; Zbl 1139.03313) Full Text: DOI arXiv Link
Kun, Gábor; Nešetřil, Jaroslav Forbidden lifts (NP and CSP for combinatorialists). (English) Zbl 1213.68323 Eur. J. Comb. 29, No. 4, 930-945 (2008). MSC: 68Q19 03C13 05C15 68Q15 PDFBibTeX XMLCite \textit{G. Kun} and \textit{J. Nešetřil}, Eur. J. Comb. 29, No. 4, 930--945 (2008; Zbl 1213.68323) Full Text: DOI arXiv
Fagin, Ronald; Kolaitis, Phokion G.; Miller, Renée J.; Popa, Lucian Data exchange: semantics and query answering. (English) Zbl 1080.68019 Theor. Comput. Sci. 336, No. 1, 89-124 (2005). MSC: 68P05 03B70 68P15 68Q65 PDFBibTeX XMLCite \textit{R. Fagin} et al., Theor. Comput. Sci. 336, No. 1, 89--124 (2005; Zbl 1080.68019) Full Text: DOI
Dalmau, Víctor A new tractable class of constraint satisfaction problems. (English) Zbl 1075.68082 Ann. Math. Artif. Intell. 44, No. 1-2, 61-85 (2005). MSC: 68T20 03B05 68T15 PDFBibTeX XMLCite \textit{V. Dalmau}, Ann. Math. Artif. Intell. 44, No. 1--2, 61--85 (2005; Zbl 1075.68082) Full Text: DOI
Nešetřil, Jaroslav; Shelah, Saharon On the order of countable graphs. (English) Zbl 1030.03028 Eur. J. Comb. 24, No. 6, 649-663 (2003). MSC: 03C50 05C60 05C15 03C98 06A07 03C64 PDFBibTeX XMLCite \textit{J. Nešetřil} and \textit{S. Shelah}, Eur. J. Comb. 24, No. 6, 649--663 (2003; Zbl 1030.03028) Full Text: DOI arXiv
Larson, Jean A.; Mitchell, William J. On a problem of Erdős and Rado. (English) Zbl 0895.05043 Ann. Comb. 1, No. 3, 245-252 (1997). Reviewer: R.Faudree (Memphis) MSC: 05C55 05C20 03E10 PDFBibTeX XMLCite \textit{J. A. Larson} and \textit{W. J. Mitchell}, Ann. Comb. 1, No. 3, 245--252 (1997; Zbl 0895.05043) Full Text: DOI
Bauslaugh, Bruce L. Compactness and finite equivalence of infinite digraphs. (English) Zbl 0878.05038 Discrete Math. 167-168, 115-126 (1997). Reviewer: M.Demlová (Praha) MSC: 05C20 03C50 PDFBibTeX XMLCite \textit{B. L. Bauslaugh}, Discrete Math. 167--168, 115--126 (1997; Zbl 0878.05038) Full Text: DOI
Grant, Ken; Nowakowski, R. J.; Rival, Ivan The endomorphism spectrum of an ordered set. (English) Zbl 0849.06002 Order 12, No. 1, 45-55 (1995). MSC: 06A06 05C35 05B05 03C13 PDFBibTeX XMLCite \textit{K. Grant} et al., Order 12, No. 1, 45--55 (1995; Zbl 0849.06002) Full Text: DOI
Funk, Martin; Kegel, Otto H.; Strambach, Karl Gruppenuniversalität und Homogenisierbarkeit. (German) Zbl 0588.03021 Ann. Mat. Pura Appl., IV. Ser. 141, 1-126 (1985). Reviewer: J.Cannon MSC: 03C99 20B25 51Exx 20A15 20B27 PDFBibTeX XMLCite \textit{M. Funk} et al., Ann. Mat. Pura Appl. (4) 141, 1--126 (1985; Zbl 0588.03021) Full Text: DOI
Nešetřil, Jaroslav On symmetric and antisymmetric relations. (English) Zbl 0248.05119 Monatsh. Math. 76, 323-327 (1972). MSC: 05C25 05C20 03E20 20B25 PDFBibTeX XMLCite \textit{J. Nešetřil}, Monatsh. Math. 76, 323--327 (1972; Zbl 0248.05119) Full Text: DOI EuDML