Browsing IMSc Library Digital Repository by Author "Anil Shukla"

Browsing IMSc Library Digital Repository by Author "Anil Shukla"

Sort by: Order: Results:

  • Anil Shukla (, 2017-05-16)
    Propositional proof complexity–a sub-branch of computational complexity–is an extensively studied area, with a number of lower bound techniques for various propositional proof systems (for example Resolution, and Cutting ...

Search DSpace


Advanced Search

Browse

My Account