Kamu erişimi zorunlu olan makaleler - Nicola GalesiDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
Polynomial calculus space and resolution width
N Galesi, L Kolodziejczyk, N Thapen
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
Zorunlu olanlar: European Commission, Government of Italy
Bir yerde sunuluyor: 11
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
O Beyersdorff, N Galesi, M Lauria
Information Processing Letters 110 (23), 1074-1077, 2010
Zorunlu olanlar: German Research Foundation
Total space in resolution
I Bonacina, N Galesi, N Thapen
SIAM Journal on Computing 45 (5), 1894-1909, 2016
Zorunlu olanlar: European Commission
The space complexity of cutting planes refutations
N Galesi, P Pudlák, N Thapen
Leibniz International Proceedings in Informatics, LIPIcs 33, 433-447, 2015
Zorunlu olanlar: European Commission
Cops-robber games and the resolution of tseitin formulas
N Galesi, N Talebanfard, J Torán
ACM Transactions on Computation Theory (TOCT) 12 (2), 1-22, 2020
Zorunlu olanlar: European Commission
Vertex-connectivity for node failure identification in boolean network tomography
N Galesi, F Ranjbar, M Zito
Algorithms for Sensor Systems: 15th International Symposium on Algorithms …, 2019
Zorunlu olanlar: Government of Italy
Hardness of parameterized resolution
O Beyersdorff, N Galesi, M Lauria
Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2010
Zorunlu olanlar: German Research Foundation
Proof complexity and the binary encoding of combinatorial principles
S Dantchev, N Galesi, A Ghani, B Martin
SIAM Journal on Computing 53 (3), 764-802, 2024
Zorunlu olanlar: UK Engineering and Physical Sciences Research Council
Leibniz International Proceedings in Informatics (LIPIcs): 38th Computational Complexity Conference (CCC 2023)
N Galesi, JA Grochow, T Pitassi, A She
Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2023
Zorunlu olanlar: US National Science Foundation, Natural Sciences and Engineering Research …
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares
I Bonacina, N Galesi, M Lauria
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 241, 1-15, 2022
Zorunlu olanlar: Government of Spain
The strength of parameterized tree-like resolution
O Beyersdorff, N Galesi, M Lauria
Preprint, 2010
Zorunlu olanlar: German Research Foundation
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
I Bonacina, N Galesi, M Lauria
computational complexity 32 (2), 12, 2023
Zorunlu olanlar: Government of Spain
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir