The following pages link to Johann A. Makowsky (Q452475):
Displaying 50 items.
- (Q169280) (redirect page) (← links)
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- Remembering Ernst Specker (1920--2011) (Q452476) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Characterizing specification languages which admit initial semantics (Q792080) (← links)
- Positive results in abstract model theory: a theory of compact logics (Q796519) (← links)
- Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions (Q987376) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning (Q1024815) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- An extension of the bivariate chromatic polynomial (Q1041177) (← links)
- Propositional dynamic logic with local assignments (Q1062972) (← links)
- Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797) (← links)
- On the existence of polynomial time algorithms for interpolation problems in propositional logic (Q1118581) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- Problemi di decidibilita in logica topologica (Q1255489) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- The undecidability of orthogonal and origami geometries (Q1799289) (← links)
- On the expressive power of data dependencies (Q1822528) (← links)
- The parametrized complexity of knot polynomials (Q1877705) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445) (← links)
- Almost unimodal and real-rooted graph polynomials (Q2107505) (← links)
- Some thoughts on computational models: from massive human computing to abstract state machines, and beyond (Q2117588) (← links)
- Weakly distinguishing graph polynomials on addable properties (Q2211265) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- (Q2702579) (← links)
- (Q2753688) (← links)
- (Q2757822) (← links)
- (Q2768337) (← links)
- Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width (Q2798025) (← links)
- Hankel Matrices for Weighted Visibly Pushdown Automata (Q2798742) (← links)
- Hankel Matrices: From Words to Graphs (Extended Abstract) (Q2799161) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths (Q2898455) (← links)
- Model Theory in Computer Science: My Own Recurrent Themes (Q2915711) (← links)
- Connection Matrices and the Definability of Graph Parameters (Q2929592) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
