Show simple item record

dc.contributor.authorMolony, Jimen
dc.date.accessioned2019-02-15T14:37:37Z
dc.date.available2019-02-15T14:37:37Z
dc.date.issued2000en
dc.identifier.urihttp://hdl.handle.net/1842/35383
dc.description.abstracten
dc.description.abstractWe establish computational complexity results for a number of simple problem formulations connecting group action and prepositional formulas. The results are discussed in the context of complexity results arising from established work in the area of automated reasoning techniques which exploit symmetry.en
dc.publisherThe University of Edinburghen
dc.relation.ispartofAnnexe Thesis Digitisation Project 2019 Block 22en
dc.relation.isreferencedbyAlready catalogueden
dc.titleSymmetry and complexity in propositional reasoningen
dc.typeThesis or Dissertationen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhD Doctor of Philosophyen


Files in this item

This item appears in the following Collection(s)

Show simple item record