Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371525
Title: Topics in computational complexity
Author: Farr, Graham E.
Awarding Body: University of Oxford
Current Institution: University of Oxford
Date of Award: 1986
Availability of Full Text:
Access through EThOS:
Full text unavailable from EThOS. Please try the link below.
Access through Institution:
Abstract:
The final Chapter concerns a problem of partitioning graphs subject to certain restrictions. We prove that several subproblems are NP-complete.
Supervisor: Welsh, D. J. A. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.371525  DOI: Not available
Keywords: Computational complexity ; Combinatorial enumeration problems ; Percolation (Statistical physics) Mathematics Mathematical statistics Operations research Computer software
Share: