The Hardness of Decision Tree Complexity

AuthID
 P-010-43A
2
Author(s)
Milovanov, A
4
Editor(es)
Beyersdorff,O;Pilipczuk,M;Pimentel,E;Thang,NK
Tipo de Documento
Proceedings Paper
Year published
2025
Publicado
in 42ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2025 in Leibniz International Proceedings in Informatics, ISSN: 1868-8969
Volume: 327, Páginas: TR24-034 (13)
Conference
42Nd International Symposium on Theoretical Aspects of Computer Science-Stacs, Date: MAR 04-07, 2025, Location: Jena, GERMANY
Indexing
Wos®
Scopus®
Dblp®/pt/publications/view/1052778
Google Scholar®
Publication Identifiers
DBLP: journals/eccc/LoffM24
SCOPUS: 2-s2.0-85219518917
Wos: WOS:001532683200066
Source Identifiers
ISSN: 1868-8969
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2025 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service