Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Solving Sparse Random Instanc...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Bibliographic Details
Main Authors:
Scott, A
,
Sorkin, G
Format:
Journal article
Published:
2006
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
Linear-programming design and analysis of fast algorithms for Max 2-CSP
by: Scott, A, et al.
Published: (2007)
On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019)
Supermodular Functions and the Complexity of MAX CSP
by: Cohen, D, et al.
Published: (2004)
Supermodular functions and the complexity of MAX CSP
by: Cohen, D, et al.
Published: (2005)
Identifying efficiently solvable cases of Max CSP
by: Cohen, D, et al.
Published: (2004)