default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Galesi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-connectivity for node failure identification in Boolean Network Tomography. Inf. Process. Lett. 184: 106450 (2024)- [j26]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. Log. Methods Comput. Sci. 20(1) (2024) - [j25]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. 53(3): 764-802 (2024) - [c30]Nicola Galesi, Fariba Ranjbar:
The Complexity of Boolean Failure Identification. ICTCS 2024: 146-157 - 2023
- [j24]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Ann. Pure Appl. Log. 174(1): 103166 (2023) - [j23]Ilario Bonacina
, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Comput. Complex. 32(2): 12 (2023) - [c29]Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She:
On the Algebraic Proof Complexity of Tensor Isomorphism. CCC 2023: 4:1-4:40 - [i34]Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She:
On the algebraic proof complexity of Tensor Isomorphism. CoRR abs/2305.19320 (2023) - 2022
- [j22]Nicola Galesi, Fariba Ranjbar:
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography. Theor. Comput. Sci. 919: 103-117 (2022) - [c28]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. MFCS 2022: 23:1-23:15 - [c27]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. STACS 2022: 24:1-24:18 - [i33]Ilario Bonacina, Nicola Galesi, Massimo Lauria:
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i32]Nicola Galesi, Fariba Ranjbar:
Counting and localizing defective nodes by Boolean network tomography. CoRR abs/2101.04403 (2021) - [i31]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. CoRR abs/2102.07622 (2021) - [i30]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j21]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber Games and the Resolution of Tseitin Formulas. ACM Trans. Comput. Theory 12(2): 9:1-9:22 (2020) - [i29]Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof complexity and the binary encoding of combinatorial principles. CoRR abs/2008.02138 (2020)
2010 – 2019
- 2019
- [c26]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography. ALGOSENSORS 2019: 79-95 - [c25]Stefan S. Dantchev, Nicola Galesi, Barnaby Martin:
Resolution and the Binary Encoding of Combinatorial Principles. CCC 2019: 6:1-6:25 - [c24]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial Calculus Space and Resolution Width. FOCS 2019: 1325-1337 - [c23]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. MFCS 2019: 49:1-49:15 - [i28]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i27]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c22]Nicola Galesi, Fariba Ranjbar:
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography. ICDCS 2018: 212-222 - [c21]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber Games and the Resolution of Tseitin Formulas. SAT 2018: 311-326 - [i26]Stefan S. Dantchev, Nicola Galesi, Barnaby Martin:
Resolution and the binary encoding of combinatorial principles. CoRR abs/1809.02843 (2018) - [i25]Nicola Galesi, Fariba Ranjbar, Michele Zito:
Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography. CoRR abs/1812.01637 (2018) - [i24]Stefan S. Dantchev, Nicola Galesi, Barnaby Martin:
Resolution and the binary encoding of combinatorial principles. Electron. Colloquium Comput. Complex. TR18 (2018) - [i23]Nicola Galesi, Navid Talebanfard, Jacobo Torán:
Cops-Robber games and the resolution of Tseitin formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j20]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. Inf. Comput. 255: 165-176 (2017) - [i22]Nicola Galesi, Fariba Ranjbar:
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography. CoRR abs/1712.09856 (2017) - 2016
- [j19]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. SIAM J. Comput. 45(5): 1894-1909 (2016) - [j18]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ACM Trans. Comput. Log. 17(4): 26 (2016) - 2015
- [j17]Ilario Bonacina, Nicola Galesi:
A Framework for Space Complexity in Algebraic Proof Systems. J. ACM 62(3): 23:1-23:20 (2015) - [c20]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The Space Complexity of Cutting Planes Refutations. CCC 2015: 433-447 - [i21]Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan:
Space proof complexity for random 3-CNFs. CoRR abs/1503.01613 (2015) - 2014
- [c19]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total Space in Resolution. FOCS 2014: 641-650 - [c18]Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi:
Proofs of Space: When Space Is of the Essence. SCN 2014: 538-557 - [i20]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. CoRR abs/1411.1619 (2014) - [i19]Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan:
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. Electron. Colloquium Comput. Complex. TR14 (2014) - [i18]Ilario Bonacina, Nicola Galesi, Neil Thapen:
Total space in resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - [i17]Nicola Galesi, Pavel Pudlák, Neil Thapen:
The space complexity of cutting planes refutations. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j16]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A characterization of tree-like Resolution size. Inf. Process. Lett. 113(18): 666-671 (2013) - [j15]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Parameterized Complexity of DPLL Search Procedures. ACM Trans. Comput. Log. 14(3): 20:1-20:21 (2013) - [c17]Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. ITCS 2013: 455-472 - [i16]Giuseppe Ateniese, Ilario Bonacina, Antonio Faonio, Nicola Galesi:
Proofs of Space: When Space is of the Essence. IACR Cryptol. ePrint Arch. 2013: 805 (2013) - 2012
- [j14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is not Optimal. ACM Trans. Comput. Theory 4(3): 7:1-7:16 (2012) - [i15]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer:
SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012) - [i14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Characterization of Tree-Like Resolution Size. Electron. Colloquium Comput. Complex. TR12 (2012) - [i13]Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c16]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
Paris-Harrington Tautologies. CCC 2011: 93-103 - [c15]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641 - [c14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18 - 2010
- [j13]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Inf. Process. Lett. 110(23): 1074-1077 (2010) - [j12]Nicola Galesi, Massimo Lauria:
On the Automatizability of Polynomial Calculus. Theory Comput. Syst. 47(2): 491-506 (2010) - [j11]Nicola Galesi, Massimo Lauria:
Optimality of size-degree tradeoffs for polynomial calculus. ACM Trans. Comput. Log. 12(1): 4:1-4:22 (2010) - [i12]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Circuits, Logic, and Games 2010 - [i11]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
Hardness of Parameterized Resolution. Electron. Colloquium Comput. Complex. TR10 (2010) - [i10]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov:
Parameterized Bounded-Depth Frege is Not Optimal. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
Paris-Harrington tautologies. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i7]Nicola Galesi, Massimo Lauria:
On the Automatizability of Polynomial Calculus. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [i6]Nicola Galesi, Massimo Lauria:
Extending Polynomial Calculus to $k$-DNF Resolution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j10]Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory Comput. 2(4): 65-90 (2006) - 2005
- [c13]Nicola Galesi, Neil Thapen:
Resolution and Pebbling Games. SAT 2005: 76-90 - 2004
- [j9]Juan Luis Esteban, Nicola Galesi, Jochen Messner:
On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004) - [c12]Nicola Galesi, Neil Thapen:
The Complexity of Treelike Systems over lamda-Local Formulae. CCC 2004: 68-74 - [c11]Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004 - [c10]Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104 - [i5]Nicola Galesi, Neil Thapen:
Resolution and pebbling games. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j8]Maria Luisa Bonet, Nicola Galesi:
Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42(5): 403-414 (2003) - [j7]Eli Ben-Sasson, Nicola Galesi:
Space complexity of random formulae in resolution. Random Struct. Algorithms 23(1): 92-109 (2003) - [c9]Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327 - 2002
- [j6]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65(4): 626-638 (2002) - [c8]Juan Luis Esteban, Nicola Galesi, Jochen Messner:
On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231 - 2001
- [j5]Maria Luisa Bonet, Nicola Galesi:
Optimality of size-width tradeoffs for resolution. Comput. Complex. 10(4): 261-276 (2001) - [j4]Albert Atserias, Nicola Galesi, Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle. Math. Log. Q. 47(4): 461-474 (2001) - [j3]Salvatore Caporaso, Michele Zito, Nicola Galesi:
A predicative and decidable characterization of the polynomial classes of languages. Theor. Comput. Sci. 250(1-2): 83-99 (2001) - [c7]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone Simulations of Nonmonotone Proofs. CCC 2001: 36-41 - [c6]Eli Ben-Sasson, Nicola Galesi:
Space Complexity of Random Formulae in Resolution. CCC 2001: 42-51 - [i4]Eli Ben-Sasson, Nicola Galesi:
Space Complexity of Random Formulae in Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j2]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5): 1462-1484 (2000) - [c5]Albert Atserias, Nicola Galesi, Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle. ICALP 2000: 151-162 - [i3]Albert Atserias, Nicola Galesi, Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle. Electron. Colloquium Comput. Complex. TR00 (2000) - [i2]Albert Atserias, Nicola Galesi, Pavel Pudlák:
Monotone simulations of nonmonotone propositional proofs. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c4]Maria Luisa Bonet, Nicola Galesi:
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432 - 1998
- [c3]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647 - [i1]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j1]Nicola Galesi:
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. RAIRO Theor. Informatics Appl. 31(2): 149-158 (1997) - [c2]Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino:
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC 1997: 61-73 - [c1]Maria Luisa Bonet, Nicola Galesi:
Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL 1997: 115-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
