フォロー
Bruno Loff
Bruno Loff
LASIGE, Faculdade de Ciências da Universidade de Lisboa
確認したメール アドレス: fc.up.pt - ホームページ
タイトル
引用先
引用先
Computing with a full memory: catalytic space
H Buhrman, R Cleve, M Koucký, B Loff, F Speelman
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
582014
Computational complexity with experiments as oracles
E Beggs, JF Costa, B Loff, JV Tucker
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2008
552008
NP-hardness of circuit minimization for multi-output functions
R Ilango, B Loff, I Carboni Oliveira
CCC'20: Proceedings of the 35th Computational Complexity Conference, 1-36, 2020
512020
Simulation theorems via pseudo-random properties
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
computational complexity 28, 617-659, 2019
50*2019
Towards a reverse newman’s theorem in interactive information complexity
J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin
Algorithmica 76, 749-781, 2016
392016
Computational complexity with experiments as oracles. II. Upper bounds
E Beggs, JF Costa, B Loff, JV Tucker
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2009
352009
Simulation beats richness: new data-structure lower bounds
A Chattopadhyay, M Koucký, B Loff, S Mukhopadhyay
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
272018
Oracles and advice as measurements
E Beggs, JF Costa, B Loff, JV Tucker
Unconventional Computing: 7th International Conference, UC 2008 Vienna …, 2008
252008
Lifting theorems for equality
B Loff, S Mukhopadhyay
Leibniz International Proceedings in Informatics, LIPIcs 126, 50, 2019
24*2019
Derandomizing from random strings
H Buhrman, L Fortnow, M Koucký, B Loff
2010 IEEE 25th Annual Conference on Computational Complexity, 58-63, 2010
232010
On the complexity of measurement in classical physics
E Beggs, JF Costa, B Loff, J Tucker
Theory and Applications of Models of Computation: 5th International …, 2008
232008
Catalytic space: Non-determinism and hierarchy
H Buhrman, M Koucký, B Loff, F Speelman
Theory of Computing Systems 62, 116-135, 2018
212018
Five Views of Hypercomputation.
B Loff, JF Costa
Int. J. Unconv. Comput. 5 (3-4), 193-207, 2009
212009
Reductions to the set of random strings: The resource-bounded case
E Allender, H Buhrman, L Friedman, B Loff
Logical Methods in Computer Science 10, 2014
172014
The computational power of parsing expression grammars
B Loff, N Moreira, R Reis
Journal of Computer and System Sciences 111, 1-21, 2020
162020
Computability on reals, infinite limits and differential equations
B Loff, JF Costa, J Mycka
Applied Mathematics and Computation 191 (2), 353-371, 2007
162007
Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
H Buhrman, B Loff, S Patro, F Speelman
arXiv preprint arXiv:2106.02005, 2021
152021
Hardness of approximation for knapsack problems
H Buhrman, B Loff, L Torenvliet
Theory of Computing Systems 56, 372-393, 2015
122015
A foundation for real recursive function theory
JF Costa, B Loff, J Mycka
Annals of Pure and Applied Logic 160 (3), 255-288, 2009
122009
Memory compression with quantum random-access gates
H Buhrman, B Loff, S Patro, F Speelman
arXiv preprint arXiv:2203.05599, 2022
112022
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20