Intersection non-emptiness and hardness within polynomial time
From MaRDI portal
Publication:1622971
DOI10.1007/978-3-319-98654-8_23OpenAlexW2885558565MaRDI QIDQ1622971
Michael Wehar, Mateus de Oliveira Oliveira
Publication date: 22 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_23
Related Items (6)
On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection ⋮ Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-dimensional pattern matching against local and regular-like picture languages
This page was built for publication: Intersection non-emptiness and hardness within polynomial time
