Scholar
Bruno Loff
Google Scholar ID: tQ26LDwAAAAJ
LASIGE, Faculdade de Ciências da Universidade de Lisboa
Computational Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
736
H-index
16
i10-index
21
Publications
20
Co-authors
24
list available
Publications
3 items
The Switching Lemma shows what the Switching Lemma cannot prove: an unconditional natural-proofs barrier
2026
Cited
0
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
Co-authors
9 total
Harry Buhrman
Chief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoft
Sagnik Mukhopadhyay
Associate Professor in Computer Science
Florian Speelman
University of Amsterdam, QuSoft
Arkadev Chattopadhyay
Professor at Tata Institute of Fundamental Research
Richard Cleve
Institute for Quantum Computing, University of Waterloo
Lance Fortnow
Illinois Institute of Technology
Igor Carboni Oliveira
University of Warwick
John M. Hitchcock
Professor of Computer Science, University of Wyoming
