Nicola Galesi

Available identifiers

zbMath Open galesi.nicolaWikidataQ93947024 ScholiaQ93947024MaRDI QIDQ1405734

List of research outcomes

Publication	Date of Publication	Type
Vertex-connectivity for node failure identification in Boolean network tomography	2024-03-26	Paper
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares	2024-01-24	Paper
Cops-Robber Games and the Resolution of Tseitin Formulas	2022-12-05	Paper
Bounded-depth Frege complexity of Tseitin formulas for all graphs	2022-10-14	Paper
Resolution and the binary encoding of combinatorial principles	2022-07-27	Paper
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs	2022-07-21	Paper
Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography	2022-05-10	Paper
Cops-robber games and the resolution of Tseitin formulas	2018-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4601841	2018-01-24	Paper
A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games	2017-11-03	Paper
Space proof complexity for random 3-CNFs	2017-08-08	Paper
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies	2017-07-13	Paper
Pseudo-partitions, transversality and locality	2017-05-16	Paper
Total Space in Resolution	2016-10-28	Paper
A Framework for Space Complexity in Algebraic Proof Systems	2016-03-24	Paper
Parameterized Bounded-Depth Frege Is not Optimal	2015-09-24	Paper
Optimality of size-degree tradeoffs for polynomial calculus	2015-09-17	Paper
Parameterized Complexity of DPLL Search Procedures	2015-09-17	Paper
Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem	2014-11-06	Paper
Proofs of Space: When Space Is of the Essence	2014-10-14	Paper
A characterization of tree-like resolution size	2014-04-11	Paper
Parameterized Bounded-Depth Frege Is Not Optimal	2011-07-06	Paper
Parameterized Complexity of DPLL Search Procedures	2011-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q3002766	2011-05-24	Paper
On the automatizability of polynomial calculus	2010-10-06	Paper
Theory and Applications of Satisfiability Testing	2005-12-16	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
On the complexity of resolution with bounded conjunctions	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4737159	2004-08-11	Paper
Degree complexity for a modified pigeonhole principle	2003-09-16	Paper
Optimality of size-width tradeoffs for resolution	2003-08-26	Paper
Space complexity of random formulae in resolution	2003-08-06	Paper
Monotone simulations of non-monotone proofs.	2003-05-14	Paper
Monotone Proofs of the Pigeon Hole Principle	2002-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q2754140	2001-11-11	Paper
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems	2001-03-19	Paper
A predicative and decidable characterization of the polynomial classes of languages	2000-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q4218927	1998-11-15	Paper
A syntactic characterization of bounded-rank decision trees in terms of decision lists	1997-11-12	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Nicola Galesi