The resolution complexity of independent sets and vertex covers in random graphs

From MaRDI portal
Revision as of 01:32, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2474203

DOI10.1007/s00037-007-0230-0zbMath1137.68030OpenAlexW2079758416MaRDI QIDQ2474203

Ashish Sabharwal, Russell Impagliazzo, P. W. Beame

Publication date: 5 March 2008

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-007-0230-0




Related Items (9)




This page was built for publication: The resolution complexity of independent sets and vertex covers in random graphs