Search results
From MaRDI portal
- Paper Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity 2020-01-03 Paper Simplified algorithmic metatheorems beyond MSO:...10 bytes (17 words) - 19:36, 24 September 2023
- Unary finite automata vs. arithmetic progressions 2010-08-20 Paper Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems 2010-04-27...10 bytes (18 words) - 09:46, 6 October 2023
- gap in interval linear programming 2020-02-26 Paper Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity 2020-01-03 Paper...10 bytes (17 words) - 19:05, 24 September 2023
- max-cut under graph-MSO constraints 2020-02-10 Paper Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity 2020-01-03 Paper...10 bytes (17 words) - 18:15, 6 October 2023
- Hamiltonicity: proper \(H\)-graphs 2020-01-16 Paper Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity 2020-01-03 Paper...10 bytes (17 words) - 18:37, 24 September 2023
- Reasoning about XML with temporal logics and automata 2010-06-11 Paper Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems 2010-04-27...10 bytes (19 words) - 01:39, 10 December 2023
- Work-Efficient Parallel Parameterized Algorithms 2019-10-15 Paper A gentle introduction to applications of algorithmic metatheorems for space and circuit classes...10 bytes (16 words) - 03:32, 7 October 2023
- 2016-09-09 Paper Satisfiability via Smooth Pictures 2016-09-05 Paper An algorithmic metatheorem for directed treewidth 2016-04-07 Paper MSO Logic and the Partial...10 bytes (20 words) - 10:50, 7 October 2023
- Mining to the Proximal Point Algorithm in CAT(0) Spaces 2019-07-04 Paper Effective strong convergence of the proximal point algorithm in CAT(0) spaces 2019-02-07...10 bytes (16 words) - 13:36, 28 January 2024
- nonexpansive mappings in Banach and geodesic spaces 2017-01-11 Paper Logical metatheorems for abstract spaces axiomatized in positive bounded logic 2016-02-02...10 bytes (18 words) - 14:04, 8 December 2023
- problem for linear context-free grammars 1976-01-01 Paper Complexity metatheorems for context-free grammar problems 1976-01-01 Paper On the complexity...10 bytes (21 words) - 08:05, 9 December 2023
- problem for linear context-free grammars 1976-01-01 Paper Complexity metatheorems for context-free grammar problems 1976-01-01 Paper https://portal.mardi4nfdi...10 bytes (18 words) - 11:14, 24 September 2023
- Failures semantics and deadlocking of modular Petri nets 1989-01-01 Paper Metatheorems for decision problems on hyperedge replacement graph languages 1989-01-01...10 bytes (16 words) - 01:52, 9 December 2023
- scientific article; zbMATH DE number 714744127 statements, 1 sitelink - 09:17, 6 May 2024
- Coloring Numbers of Intersection Graphs 2021-03-31 Paper Approximation metatheorems for classes with bounded expansion 2021-03-15 Paper Bounding the number...10 bytes (17 words) - 14:15, 24 September 2023
- https://portal.mardi4nfdi.de/entity/Q4943606 2000-03-19 Paper An Optimal Algorithm for Monte Carlo Estimation 2000-03-19 Paper PRICING EXOTIC OPTIONS 2000-01-01...10 bytes (18 words) - 16:45, 10 December 2023
- scientific article15 statements, 1 sitelink - 23:00, 19 March 2024
- scientific article24 statements, 1 sitelink - 22:13, 19 March 2024
- interpretations; fixed-parameter tractability; parameterized complexity; algorithmic metatheorems; bounded-degree graphs; sparse graph classes; FO logic; logic interpretations...15 bytes (116 words) - 16:07, 2 May 2024
- available at URL: https://arxiv.org/abs/2001.00758 zbMATH Keywords algorithmic metatheorems; bidimensionality; graph completion; CMSO logic Mathematics Subject...15 bytes (44 words) - 11:42, 8 February 2024
