


default search action
SIGACT News (ACM), Volume 13
Volume 13, Number 1, Winter 1981
- Sheila A. Greibach:

Comments on the roots of theorems and languages both easy and hard. 26-29 - Uwe Schöning:

A note on complete sets for the polynomial-time hierarchy. 30-34 - Clyde P. Kruskal, Elia Weixelbaum:

A note on the worst case of heapsort. 35-38 - Technical reports. 39-87

Volume 13, Number 2, Spring - Summer 1981
- Technical reports. 16-65


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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














