Obserwuj
Anil Shukla
Anil Shukla
Department of CSE, IIT Ropar
Zweryfikowany adres z iitrpr.ac.in
Tytuł
Cytowane przez
Cytowane przez
Rok
Feasible interpolation for QBF resolution calculi
O Beyersdorff, L Chew, M Mahajan, A Shukla
Logical Methods in Computer Science 13, 2017
402017
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
O Beyersdorff, L Chew, M Mahajan, A Shukla
ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017
342017
Understanding cutting planes for QBFs
O Beyersdorff, L Chew, M Mahajan, A Shukla
Information and Computation 262, 141-161, 2018
242018
Level-ordered Q-resolution and tree-like Q-resolution are incomparable
M Mahajan, A Shukla
Information Processing Letters 116 (3), 256-258, 2016
62016
On proof complexity for quantified Boolean formulas
A Shukla
PhD thesis, The Institute of Mathematical Sciences, HBNI, India, 2017
32017
Extending Merge Resolution to a Family of QBF-Proof Systems
S Chede, A Shukla
40th International Symposium on Theoretical Aspects of Computer Science …, 2023
12023
Extending Merge Resolution to a Family of Proof Systems
S Chede, A Shukla
arXiv preprint arXiv:2112.11044, 2021
2021
QRAT Polynomially Simulates Merge Resolution
S Chede, A Shukla
arXiv preprint arXiv:2107.09320, 2021
2021
Does QRAT simulate IR-calc? QRAT simulation algorithm for Exp+Res cannot be lifted to IR-calc
S Chede, A Shukla
arXiv preprint arXiv:2107.04547, 2021
2021
Extending Prolog for Quantified Boolean Horn Formulas
A Mallick, A Shukla
arXiv preprint arXiv:2103.01046, 2021
2021
On Proof Complexity for Quantified Boolean Formulas [HBNI Th112]
A Shukla
The Institute of Mathematical Sciences, 2017
2017
Relating two width measures for resolution proofs
A Krebs, M Mahajan, A Shukla
Electron. Colloquium Comput. Complex., 2016
2016
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–12