Остановите войну!
for scientists:
default search action
Nicola Galesi
- > Home > Persons > Nicola Galesi
Publications
- 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) - 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 - [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) - 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) - 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) - 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) - [i14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A Characterization of Tree-Like Resolution Size. 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) - 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)
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 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint