Bruno Loff
Scholar

Bruno Loff

Google Scholar ID: tQ26LDwAAAAJ
LASIGE, Faculdade de Ciências da Universidade de Lisboa
Computational Complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
403
 
H-index
10
 
i10-index
10
 
Publications
20
 
Co-authors
24
list available
Contact
No contact links provided.
Publications
2 items
Communication Complexity is NP-hard
2025
Cited
0
Key-agreement exists if and only if the"interactive vs non interactive Kolmogorov problem"is not in ioBPP: a short proof
2025
Cited
0
Resume (English only)
Co-authors
24 total
Harry Buhrman
Harry Buhrman
Chief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft
Co-author 2
Co-author 2
Co-author 3
Co-author 3
Sagnik Mukhopadhyay
Sagnik Mukhopadhyay
Associate Professor in Computer Science
Florian Speelman
Florian Speelman
University of Amsterdam, QuSoft
Co-author 6
Co-author 6
Arkadev Chattopadhyay
Arkadev Chattopadhyay
Professor at Tata Institute of Fundamental Research
Richard Cleve
Richard Cleve
Institute for Quantum Computing, University of Waterloo