Bounded Arithmetic, Propositional Logic, and Complexity Theory

By: Krajicek, JanMaterial type: TextTextSeries: Encyclopedia of mathematics & its applications ; 00060Publication details: Cambridge ; Cambridge University Press ; 1995Description: 343ISBN: 0521452058Subject(s): Constructive Mathematics Proposition (Logic) Computational Complexity
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)

There are no comments on this title.

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

Powered by Koha