Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time

Chi tiết về thư mục
Những tác giả chính: Scott, A, Sorkin, G
Định dạng: Journal article
Được phát hành: 2006
_version_ 1826296571416805376
author Scott, A
Sorkin, G
author_facet Scott, A
Sorkin, G
author_sort Scott, A
collection OXFORD
description
first_indexed 2024-03-07T04:18:23Z
format Journal article
id oxford-uuid:ca2d9546-9d79-4d7b-a4b3-5dec57b7f8d2
institution University of Oxford
last_indexed 2024-03-07T04:18:23Z
publishDate 2006
record_format dspace
spelling oxford-uuid:ca2d9546-9d79-4d7b-a4b3-5dec57b7f8d22022-03-27T07:05:34Z Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected TimeJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:ca2d9546-9d79-4d7b-a4b3-5dec57b7f8d2Symplectic Elements at Oxford2006Scott, ASorkin, G
spellingShingle Scott, A
Sorkin, G
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title_full Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title_fullStr Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title_full_unstemmed Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title_short Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
title_sort solving sparse random instances of max cut and max 2 csp in linear expected time
work_keys_str_mv AT scotta solvingsparserandominstancesofmaxcutandmax2cspinlinearexpectedtime
AT sorking solvingsparserandominstancesofmaxcutandmax2cspinlinearexpectedtime