Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A dichotomy theorem for the resolution complexity of random constraint satisfaction problems - MaRDI portal

A dichotomy theorem for the resolution complexity of random constraint satisfaction problems

From MaRDI portal

Publication:2839170

Jump to:navigation, search

DOI10.1137/110832240zbMATH Open1270.03122OpenAlexW2045417786MaRDI QIDQ2839170

Michael Molloy, Siu On Chan

Publication date: 4 July 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110832240

zbMATH Keywords

random constraint satisfaction problems resolution complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: A dichotomy theorem for the resolution complexity of random constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839170)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2839170&oldid=15762079"