Paper Info
Title
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity.
Year
DOI
Venue
2019
10.4230/LIPIcs.ICALP.2019.64
international colloquium on automata, languages and programming
Field
DocType
Citations 
Discrete mathematics,Computer science
Conference
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Dmitry Gavinsky116620.21
Troy Lee2704.27
Miklós Sántha3967.95
Swagato Sanyal413.39