Skip to content

Rankings Industries Companies Research Blog

Sign in List your company

ResearchFormerly WizWand

Papers Benchmarks Datasets Tasks

Research
Benchmarks
Max-Clique on CO problems (test)

Max-Clique on CO problems (test)

0.019Time (s)VC-2-FMPNN

Updated 6mo ago

Evaluation results

Method	Links
VC-2-FMPNN2026.04		0.019	43.6	0
SCS2026.04		0.642	—	—

State-of-the-art paper

VC-2-FMPNN

On the Expressive Power of GNNs to Solve Linear SDPs

Dataset

CO problems

Follow for updates

Join SOTA2 Contact

Related benchmarks

Solving Linear SDPs on SDPLIB 1.2 Inference Time on Max-cut problem 50 × 50 (test)Inference Time on Max-cut problem 100 × 100 (test)Inference Time on Max-cut problem 150 × 150 (test)Max-Cut on CO problems (test)

Building an AI company?

Claim your profile, keep your facts current and see how buyers find you. Rankings are never paid for.

How rankings work List your company

Find AI companies and products for your business problem. Compare solutions and evidence by industry and task.

Explore

Rankings
Industries
Categories
Companies
Top AI companies

Read

Blog
Research
llms.txt

For AI companies

List your company
Claim a profile
Ranking badges

SOTA2 with AI

Claude connector
ChatGPT plugin
Tool reference
Connector privacy
Connector terms

SOTA2

Why SOTA2
How we rank
Contact

© 2026 SOTA2Built in Bellevue, USA