Bounded arithmetic, propositional logic, and complexity theo

Krajicek, Jan

Bounded arithmetic, propositional logic, and complexity theo - Cambridge Cambridge Uni Pr 1995 - 343p;hbk - Encyclopedia of mathematics and its applications .

0-521-45205-8


Computitional complexity
Proposition(Logic)
Constructive mathematics
Mathematics

511.3/KRA

For any Suggestions or Query, please contact the library staff @ lib@igidr.ac.in or Phone: 022-69096504/69096563