Found: 9
Select item for more details and to access through your institution.
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 581, doi. 10.1007/s00224-016-9686-0
- By:
- Publication type:
- Article
Database Query Processing Using Finite Cursor Machines.
- Published in:
- Theory of Computing Systems, 2009, v. 44, n. 4, p. 533, doi. 10.1007/s00224-008-9137-7
- By:
- Publication type:
- Article
Learnability and Definability in Trees and Similar Structures.
- Published in:
- Theory of Computing Systems, 2004, v. 37, n. 1, p. 193, doi. 10.1007/s00224-003-1112-8
- By:
- Publication type:
- Article
Some Remarks on Finite Löwenheim-Skolem Theorems.
- Published in:
- Mathematical Logic Quarterly, 1996, v. 42, n. 1, p. 569, doi. 10.1002/malq.19960420145
- By:
- Publication type:
- Article
PEBBLE GAMES AND LINEAR EQUATIONS.
- Published in:
- Journal of Symbolic Logic, 2015, v. 80, n. 3, p. 797, doi. 10.1017/jsl.2015.28
- By:
- Publication type:
- Article
Existential Least Fixed-Point Logic and Its Relatives.
- Published in:
- Journal of Logic & Computation, 1997, v. 7, n. 2, p. 205, doi. 10.1093/logcom/7.2.205
- By:
- Publication type:
- Article
Graph machine learning for design of high‐octane fuels.
- Published in:
- AIChE Journal, 2023, v. 69, n. 4, p. 1, doi. 10.1002/aic.17971
- By:
- Publication type:
- Article
Weisfeiler and Leman go Machine Learning: The Story so far.
- Published in:
- Journal of Machine Learning Research, 2023, v. 24, p. 1
- By:
- Publication type:
- Article
DEFINABLE DECOMPOSITIONS FOR GRAPHS OF BOUNDED LINEAR CLIQUEWIDTH.
- Published in:
- Logical Methods in Computer Science (LMCS), 2021, v. 17, n. 1, p. 1, doi. 10.23638/LMCS-17(15)2021
- By:
- Publication type:
- Article