Skip to main content

Ricerc@Sapienza

Home
Login

Home
Computational Complexity
Risultati ricerca pubblicazioni

Risultati ricerca pubblicazioni

On variants of Vertex Geography on undirected graphs

pubblicato su: DISCRETE APPLIED MATHEMATICS - 2018

Monti A., Sinaimeri B.

Trainyard is NP-Hard

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2018

Almanza M., Leucci S., Panconesi A.

Ontology-based Document Spanning Systems for Information Extraction

pubblicato su: INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING - 2020

Lembo Domenico, Scafoglieri Federico

CATALOGO IRIS SAPIENZA

Anno

2020 (1) Apply 2020 filter
2018 (2) Apply 2018 filter

Tipo pubblicazione

01 Pubblicazione su rivista (3) Apply 01 Pubblicazione su rivista filter

Rivista

DISCRETE APPLIED MATHEMATICS (1) Apply DISCRETE APPLIED MATHEMATICS filter
INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING (1) Apply INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING filter
THEORETICAL COMPUTER SCIENCE (1) Apply THEORETICAL COMPUTER SCIENCE filter

Book

Keywords

(-) Remove Computational Complexity filter Computational Complexity
Algorithmic combinatorial game theory (1) Apply Algorithmic combinatorial game theory filter
Applied Mathematics (1) Apply Applied Mathematics filter
Description Logics (1) Apply Description Logics filter
information extraction (1) Apply information extraction filter
Ontologies (1) Apply Ontologies filter
Puzzle games (1) Apply Puzzle games filter
Short winning strategy problems (1) Apply Short winning strategy problems filter
Solitaire games (1) Apply Solitaire games filter
Trainyard (1) Apply Trainyard filter
Undirected vertex geography (1) Apply Undirected vertex geography filter

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma