Stop the war!
Остановите войну!
for scientists:
default search action
"Feasible computations and provable complexity properties."
Juris Hartmanis (1989)
- Juris Hartmanis:
Feasible computations and provable complexity properties. CBMS-NSF regional conference series in applied mathematics 30, SIAM 1989, ISBN 978-0-89871-027-4, pp. 1-62
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.