Stop the war!
Остановите войну!
for scientists:
default search action
"The Complexity of Counting in Sparse, Regular, and Planar Graphs."
Salil P. Vadhan (2001)
- Salil P. Vadhan:
The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM J. Comput. 31(2): 398-427 (2001)
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.