A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MAX-2-SAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-005-0101-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000579976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Sat and upper bounds on their complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank

Revision as of 14:38, 11 June 2024

scientific article
Language Label Description Also known as
English
A \(2^{|E|/4}\)-time algorithm for MAX-CUT
scientific article

    Statements

    Identifiers