Ilario Bonacina

Dikutip oleh

	Semua	Sejak 2020
Kutipan	388	166
indeks-h	8	5
indeks-i10	8	3

201220132014201520162017201820192020202120222023202420252 4 8 23 48 43 33 48 39 34 31 31 28 3

Akses publik

Lihat semua

7 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Nicola GalesiSapienza University RomeEmail yang diverifikasi di uniroma1.it
Giuseppe AtenieseGeorge Mason UniversityEmail yang diverifikasi di gmu.edu
Antonio FaonioEURECOMEmail yang diverifikasi di eurecom.fr
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyEmail yang diverifikasi di uni-jena.de
Paul WollanProfessor of Computer Science, University of Rome La SapienzaEmail yang diverifikasi di di.uniroma1.it
Tony HuynhDepartment of Computer Science, Sapienza University of RomeEmail yang diverifikasi di di.uniroma1.it
Susanna F. de RezendeLund UniversityEmail yang diverifikasi di cs.lth.se
Massimo LauriaSapienza - Università di RomaEmail yang diverifikasi di uniroma1.it
Albert AtseriasUniversitat Politècnica de Catalunya, BarcelonaEmail yang diverifikasi di cs.upc.edu
Jakob NordströmUniversity of Copenhagen and Lund UniversityEmail yang diverifikasi di di.ku.dk
Neil ThapenResearcher, Institute of Mathematics, Czech Academy of SciencesEmail yang diverifikasi di math.cas.cz
Navid TalebanfardUniversity of SheffieldEmail yang diverifikasi di sheffield.ac.uk
Leroy ChewPost Doc, TU Wien

Ikuti

Ilario Bonacina

Universitat Politècnica de Catalunya

Email yang diverifikasi di cs.upc.edu - Beranda

proof complexity logic complexity theory theoretical computer science


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Proofs of space: When space is of the essence G Ateniese, I Bonacina, A Faonio, N Galesi Security and Cryptography for Networks: 9th International Conference, SCN …, 2014	170	2014
Lower bounds: From circuits to QBF proof systems O Beyersdorff, I Bonacina, C Leroy Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016	50	2016
Clique is hard on average for regular resolution A Atserias, I Bonacina, SF De Rezende, M Lauria, J Nordström, ... Journal of the ACM (JACM) 68 (4), 1-26, 2021	33	2021
Total space in resolution. I Bonacina, N Galesi, N Thapen 55th IEEE Symposium on Foundations of Computer Science (FOCS), 641-650, 2014	32	2014
A framework for space complexity in algebraic proof systems I Bonacina, N Galesi Journal of the ACM (JACM) 62 (3), 1-20, 2015	25	2015
Pseudo-partitions, transversality and locality: A combinatorial characterization for the space measure in algebraic proof systems I Bonacina, N Galesi 4th conference on Innovations in Theoretical Computer Science (ITCS), 455-472, 2013	21	2013
Space proof complexity for random 3-CNFs P Bennett, I Bonacina, N Galesi, T Huynh, M Molloy, P Wollan Information and Computation 255, 165-176, 2017	18	2017
Total space in resolution is at least width squared I Bonacina 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016	17	2016
Strong ETH and Resolution via Games and the Multiplicity of Strategies I Bonacina, N Talebanfard Algorithmica 79, 29-41, 2017	6	2017
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis I Bonacina, N Talebanfard Information Processing Letters 116 (2), 120-124, 2016	5	2016
Space in weak propositional proof systems I Bonacina PhD thesis, Department of Computer Science, Sapienza University of Rome, 12 2015, 2015	5	2015
Space proof complexity for random -CNFs via a -Hall's Theorem I Bonacina, N Galesi, T Huynh, P Wollan arXiv preprint arXiv:1411.1619, 2014	5	2014
SAT and Interactions (Dagstuhl Seminar 16381) O Beyersdorff, N Creignou, U Egly, H Vollmer Dagstuhl Reports 6 (9), 74-93, 2017	1	2017
Improving Strong Exponential Time Hypothesis lower bounds for tree-like resolution I Bonacina, N Talebanfard		2014

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–14

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama