Stop the war!
Остановите войну!
for scientists:
default search action
"Solving NP-hard semirandom graph problems in polynomial expected time."
Amin Coja-Oghlan (2007)
- Amin Coja-Oghlan:
Solving NP-hard semirandom graph problems in polynomial expected time. J. Algorithms 62(1): 19-46 (2007)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.