Examples of hard tautologies and worst-case complexity results for propositional proof systems / Balakrishnan Krishnamurthy ; sous la direction de Robert N. Moll

Auteur principal : Krishnamurthy, Balakrishnan, AuteurAuteur secondaire : Moll, Robert N., Directeur de thèseAuteur secondaire collectivité : University of Massachusetts, Etablissement de soutenanceType de document : ThèseLangue : anglais.Pays: Etats Unis.Mention d'édition: Reprod. en fac-sim.Éditeur : Ann Arbor (Mich.) : University Microfilms International, 1993Description : 1 vol. (IX-117 f.) : fig. ; 21 cmBibliographie : Bibliogr. f. 110-117.Sujet MSC : 68Q15, Computer science - Theory of computing, Complexity classes
68Q25, Computer science - Theory of computing, Analysis of algorithms and problem complexity
03F20, Proof theory and constructive mathematics, Complexity of proofs
05C55, Combinatorics - Graph theory, Generalized Ramsey theory
97-02, Research exposition (monographs, survey articles) pertaining to mathematics educationNote de thèse: Thèse de doctorat, informatique, 1981, University of Massachusetts Item type: Thèse
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Current library Call number Status Date due Barcode
CMI
Salle S 		Thèses KRI (Browse shelf(Opens below)) Available 10797-01

This is an authorized facsimile and was produced by microfilm-xerography in 1981 by UNIVERSITY MICROFILMS INTERNATIONAL (Ann Arbor, Michigan, U.S.A)

Bibliogr. f. 110-117

Thèse de doctorat informatique 1981 University of Massachusetts

There are no comments on this title.

to post a comment.