Toggle navigation
Publications
Researchers
Institutions
0
Sign In
Federated Authentication
(Click on the image)
Local Sign In
Password Recovery
Register
Sign In
Publications
Search
Statistics
The Hardness of Decision Tree Complexity
AuthID
P-018-AB8
2
Author(s)
Loff, B
·
Milovanov, A
4
Editor(s)
Beyersdorff,O;Pilipczuk,M;Pimentel,E;Nguyen,KT
Document Type
Proceedings Paper
Year published
2025
Published
in
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, March 4-7, 2025, Jena, Germany
in
LIPIcs
Volume: 327, Pages: 66:1-66:13
Indexing
Dblp
®
/en/publications/view/1321320
Metadata
Sources
Publication Identifiers
Dblp
: conf/stacs/LoffM25
Export Publication Metadata
Export
×
Publication Export Settings
BibTex
EndNote
APA
Export Preview
Marked List
Add to Marked List
Info
At this moment we don't have any links to full text documens.
×
Select Source
This publication has:
2 records from
ISI
2 records from
SCOPUS
2 records from
DBLP
2 records from
Unpaywall
2 records from
Openlibrary
2 records from
Handle
2 records from
DataCite
Please select which records must be used by Authenticus!
×
Preview Publications
© 2025 CRACS & Inesc TEC - All Rights Reserved
Privacy Policy
|
Terms of Service