Papers

	Select
Year:	recent allto appear202520242023202220212020201920182017201620152014	Type	all ArticleBookPaper in proceedingsChapter in monographReport	Investigators	all AKBARABATABAI AMIRHOSSEINDELIVEIRALIVEIRA MATEUSGARLIK MICHALGLIVICKY PETRHRUBES PAVELJALALIESHAVARZ RAHELEHJERABEK EMILKHANIKI ERFANPUDLAK PAVELTALEBANFARD NAVIDTHAPEN NEILILLIP

Recent 5

 Article    
Kołodziejczyk Leszek Aleksander, Thapen Neil Dillip
Approximate counting and NP search problems
Journal of Mathematical Logic 22 (3), 2022, 2250012-.

 Article    
Khaniki Erfan
New relations and separations of conjectures about incompleteness in the finite domain
Journal of Symbolic Logic 87 (3), 2022, 912-937.

 Article    
Buss Sam, Thapen Neil Dillip
DRAT and propagation redundancy proofs without new variables
Logical Methods in Computer Science 17 (2), 2021, 12-.

 Article    
Pudlák Pavel
The canonical pairs of bounded depth Frege systems
Annals of Pure and Applied Logic 172 (2), 2021, 102892-.

 Paper in proceedings    
Galesi Nicola, Kolodziejczyk Leszek A., Thapen Neil Dillip
Polynomial calculus space and resolution width
in Proceedings of the 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), Baltimore, Maryland, 9.11.2019 - 12.11.2019, editor(s): -, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Piscataway, 2019, 1325-1337.