Phase transitions and typical-case complexity: easy (hard) aspects of hard (easy) problems
| dc.contributor.author | Gao, Yong | |
| dc.date.accessioned | 2025-05-29T01:38:00Z | |
| dc.date.available | 2025-05-29T01:38:00Z | |
| dc.date.issued | 2005 | |
| dc.identifier.doi | https://doi.org/10.7939/r3-bvfe-3v82 | |
| dc.language.iso | en | |
| dc.rights | This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for the purpose of private, scholarly or scientific research. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law. | |
| dc.subject | Computer algorithms. | |
| dc.subject | Constraints (Artificial intelligence) | |
| dc.title | Phase transitions and typical-case complexity: easy (hard) aspects of hard (easy) problems | |
| dc.type | http://purl.org/coar/resource_type/c_46ec | |
| thesis.degree.grantor | http://id.loc.gov/authorities/names/n79058482 | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy | |
| ual.date.graduation | 2005 | |
| ual.department | Department of Computing Science | |
| ual.jupiterAccess | http://terms.library.ualberta.ca/public |
Files
Original bundle
1 - 1 of 1