The Hardness of Decision Tree Complexity

AuthID
 P-018-AB8
2
Author(s)
Milovanov, A
4
Editor(es)
Beyersdorff,O;Pilipczuk,M;Pimentel,E;Nguyen,KT
Tipo de Documento
Proceedings Paper
Year published
2025
Publicado
in 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany in LIPIcs
Volume: 327, Páginas: 66:1-66:13
Indexing
Dblp®/pt/publications/view/1321320
Publication Identifiers
DBLP: conf/stacs/LoffM25
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