Stop the war!
Остановите войну!
for scientists:
default search action
"Corrigendum: The complexity of counting graph homomorphisms."
Martin E. Dyer, Catherine S. Greenhill (2004)
- Martin E. Dyer, Catherine S. Greenhill:
Corrigendum: The complexity of counting graph homomorphisms. Random Struct. Algorithms 25(3): 346-352 (2004)
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.