Publications

The Hardness of Decision Tree Complexity

AuthID
P-010-43A

Author(s)

Loff, B

Milovanov, A

Editor(s)

Beyersdorff,O;Pilipczuk,M;Pimentel,E;Thang,NK

Document Type

Proceedings Paper

Year published

2025

Published

in 42ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2025 in Leibniz International Proceedings in Informatics, ISSN: 1868-8969

Volume: 327, Pages: 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^®/en/publications/view/1052778

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.4230/lipics.stacs.2025.66

Dblp: journals/eccc/LoffM24

Scopus: 2-s2.0-85219518917

Wos: WOS:001532683200066

Source Identifiers

ISSN: 1868-8969

Export Publication Metadata

Marked List

Add to Marked List

Info

At this moment we don't have any links to full text documens.

The Hardness of Decision Tree Complexity

Useful Links

Get Help

Federated Authentication (Click on the image)

The Hardness of Decision Tree Complexity

Useful Links

Get Help