Artikel dengan mandat akses publik - Neil ThapenPelajari lebih lanjut
Tidak tersedia di mana pun: 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
Mandat: European Commission, Government of Italy
Tersedia di suatu tempat: 11
Space complexity in polynomial calculus
Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen
SIAM Journal on Computing 44 (4), 1119-1153, 2015
Mandat: Swedish Research Council, European Commission
Total space in resolution
I Bonacina, N Galesi, N Thapen
SIAM Journal on Computing 45 (5), 1894-1909, 2016
Mandat: European Commission
The space complexity of cutting planes refutations
N Galesi, P Pudlák, N Thapen
Proceedings of the 30th Conference on Computational Complexity, 433-447, 2015
Mandat: European Commission
The complexity of proving that a graph is Ramsey
M Lauria, P Pudlák, V Rödl, N Thapen
Combinatorica 37 (2), 253-268, 2017
Mandat: US National Science Foundation, European Commission
Random resolution refutations
P Pudlák, N Thapen
LIPIcs-Leibniz International Proceedings in Informatics 79, 2017
Mandat: European Commission
Approximate counting and NP search problems
LA Kołodziejczyk, N Thapen
Journal of Mathematical Logic 22 (03), 2250012, 2022
Mandat: European Commission, Narodowe Centrum Nauki
Cobham recursive set functions
A Beckmann, S Buss, SD Friedman, M Müller, N Thapen
Annals of Pure and Applied Logic 167 (3), 335-369, 2016
Mandat: US National Science Foundation, Austrian Science Fund
On semantic cutting planes with very small coefficients
M Lauria, N Thapen
Information Processing Letters 136, 70-75, 2018
Mandat: European Commission
Cobham recursive set functions and weak set theories
A Beckmann, S Buss, SD Friedman, M Müller, N Thapen
Sets And Computations, 55, 2016
Mandat: European Commission
First-order reasoning and efficient semi-algebraic proofs
F Part, N Thapen, I Tzameret
Annals of Pure and Applied Logic 176 (1), 103496, 2025
Mandat: European Commission
Feasible set functions have small circuits
A Beckmann, S Buss, SD Friedman, M Müller, N Thapen
Computability, 1-32, 2019
Mandat: US National Science Foundation, Austrian Science Fund, European Commission
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer