On proof complexity for Quantied Boolean formulas

By: Material type: TextTextPublication details: 2017Description: 141pSubject(s): Online resources: Dissertation note: Ph.D HBNI 2017
Item type: THESIS & DISSERTATION
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Collection Call number Materials specified URL Status Date due Barcode
IMSc Library IMSc Thesis HBNI Th112 (Browse shelf(Opens below)) Link to resource Available 72932

Thesis

Ph.D HBNI 2017

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India