Krajíček, Jan <br/><br/>
Bounded arithmetic, propositional logic, and complexity theory 

 - Cambridge:  Cambridge University Press,  1995 
 - xiv, 343 p. ; 24 cm. 
<br/><br/><label>ISBN: </label>9780521452052 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computational complexity
<br/><br/><label>Dewey Class. No.: </label>511.3 KRA