Nicola Galesi | Ricerc@Sapienza

Pubblicazioni

Titolo	Pubblicato in	Anno
Vertex-connectivity for node failure identification in Boolean Network Tomography	INFORMATION PROCESSING LETTERS	2024
DEPTH LOWER BOUNDS IN STABBING PLANES FOR COMBINATORIAL PRINCIPLES∗	LOGICAL METHODS IN COMPUTER SCIENCE	2024
Proof complexity and the binary encoding of combinatorial principles	SIAM JOURNAL ON COMPUTING	2024
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares		2023
On the Algebraic Proof Complexity of Tensor Isomorphism		2023
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography	THEORETICAL COMPUTER SCIENCE	2022
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles	Leibniz International Proceedings in Informatics, LIPIcs	2022
Bounded-depth Frege complexity of Tseitin formulas for all graphs	ANNALS OF PURE AND APPLIED LOGIC	2022
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares	Leibniz International Proceedings in Informatics, LIPIcs	2022
Cops-Robber Games and the Resolution of Tseitin Formulas	ACM TRANSACTIONS ON COMPUTATION THEORY	2020
Resolution and the binary encoding of combinatorial principles	Leibniz International Proceedings in Informatics, LIPIcs	2019
Bounded-depth frege complexity of tseitin formulas for all graphs	Leibniz International Proceedings in Informatics, LIPIcs	2019
Vertex-connectivity for node failure identification in boolean network tomography	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	2019
Polynomial calculus space and resolution width	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS	2019
Cops-Robber games and the resolution of Tseitin Formulas	21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018 Held as Part of the Federated Logic Conference, FloC 2018; Oxford; United Kingdom; 9 July 2018 through 12 July 2018; Code 215249	2018
Tight bounds for maximal identifiability of failure nodes in boolean network tomography	Proceedings - International Conference on Distributed Computing Systems	2018
Space proof complexity for random 3-CNFs	INFORMATION AND COMPUTATION	2017
A framework for space complexity in algebraic proof systems	JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY	2016
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies	ACM TRANSACTIONS ON COMPUTATIONAL LOGIC	2016
Total space in resolution	SIAM JOURNAL ON COMPUTING	2016