h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

The Complexity Classes of Hamming Distance Recoverable Robust Problems



In
LATIN 2024: Theoretical Informatics : 16th Latin American Symposium, Puerto Varas, Chile, March 18–22, 2024, Proceedings, Part I / edited by José A. Soto, Andreas Wiese, Seiten/Artikel-Nr: 321-335

Konferenz/Event:16. Latin American Symposium , Puerto Varas , Chile , LATIN 2024 , 2024-03-18 - 2024-03-22

ImpressumCham : Springer

Umfang321-335

ISBN978-3-031-55597-8, 978-3-031-55598-5, 978-3-031-55599-2

ReiheLecture notes in computer science ; 14578

Online
DOI: 10.1007/978-3-031-55598-5_21


Einrichtungen

  1. Lehrstuhl für Algorithmen und Komplexität (Informatik 1) (121110)
  2. Graduiertenkolleg UnRAVeL (080060)
  3. Fachgruppe Informatik (120000)

Projekte

  1. GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900) (282652900)


Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online, print

Sprache
English

Anmerkung
Peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85188668917
WOS Core Collection: WOS:001214186800021

Interne Identnummern
RWTH-2024-08100
Datensatz-ID: 992261

Beteiligte Länder
Germany

 GO

NationallizenzNationallizenz ; SCOPUS
QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Computer Science (Fac.9)
Central and Other Institutions
Public records
Publications database
120000
121110
080060
 Record created 2024-08-30, last modified 2025-10-06
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)