Zobrazeno 1 - 10
of 53
pro vyhledávání: '"de Oliveira Oliveira, Mateus"'
Autor:
Dourado, Mitre C., de Figueiredo, Celina M.H., de Melo, Alexsander A., de Oliveira Oliveira, Mateus, Souza, Uéverton S.
Publikováno v:
In Discrete Applied Mathematics 15 May 2022 312:86-105
Autor:
Baste, Julien, Fellows, Michael R., Jaffke, Lars, Masařík, Tomáš, de Oliveira Oliveira, Mateus, Philip, Geevarghese, Rosamond, Frances A.
Publikováno v:
In Artificial Intelligence February 2022 303
Autor:
Alves, Mateus Rodrigues, de Oliveira Oliveira, Mateus, Nascimento Silva, Janio Carlos, dos Santos Souza, Uéverton
Publikováno v:
In Theoretical Computer Science 8 October 2021 889:1-13
Autor:
de Oliveira Oliveira, Mateus
Slices are digraphs that can be composed together to form larger digraphs.In this thesis we introduce the foundations of a theory whose aim is to provide ways of defining and manipulating infinite families of combinatorial objects such as graphs, par
Externí odkaz:
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134211
Publikováno v:
In Theoretical Computer Science 22 December 2020 847:27-38
Autor:
de Melo, Alexsander Andrade1 (AUTHOR), de Oliveira Oliveira, Mateus2 (AUTHOR) mateus.oliveira@uib.no
Publikováno v:
Theory of Computing Systems. Aug2022, Vol. 66 Issue 4, p861-909. 49p.
Autor:
de Oliveira Oliveira, Mateus
Publikováno v:
In Discrete Applied Mathematics 11 May 2016 204:49-76
Publikováno v:
Developments in Language Theory
We study the fine grained complexity of the DFA non-emptiness of intersection problem parameterized by the number k of input automata (k -DFA-NEI). More specifically, we are given a list \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::ebf2ef23d661fb02419fcb8f38399544
http://europepmc.org/articles/PMC7247879
http://europepmc.org/articles/PMC7247879