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-010-43A
2
Author(s)
Loff, B
·
Milovanov, A
4
Editor(s)
Beyersdorff,O;Pilipczuk,M;Pimentel,E;Thang,NK
Document Type
Article in Press
Year published
2024
Published
in
Electron. Colloquium Comput. Complex.,
ISSN: 1868-8969
Volume: TR24, Pages: TR24-034
Conference
42Nd International Symposium on Theoretical Aspects of Computer Science, Stacs 2025,
Date:
4 March 2025 through 7 March 2025,
Location:
Jena
Indexing
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
Source Identifiers
ISSN
: 1868-8969
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