default search action
SIGACT News (ACM), Volume 14
Volume 14, Number 1, Winter 1982
- Uwe Schöning:
On NP-decomposable sets. 18-20 - Karel Culík:
Theory of computation on abstract/concrete computer automata. 21-35 - Donald F. Stanat, Stephen F. Weiss:
A pumping theorem for regular languages. 36-37 - Timothy R. S. Walsh:
The busy beaver on a one-way infinite tape. 38-43 - Recent technical reports. 44-65
Volume 14, Number 2, Spring 1982
- Technical reports. 20-41
Volume 14, Number 3, Summer 1982
- Lawrence H. Landweber:
CSNET: a tool for researchers in theoretical computer science. 21-22 - Don-Min Tsou, Patrick C. Fischer:
Decomposition of a relation scheme into Boyce-Codd Normal Form. 23-29 - Etienne Grandjean:
Number of universal quantifiers and computational complexity: preliminary report. 30 - Siroos K. Afshar:
On the complexity of permutation network design. 31-35 - Dino Mandrioli:
On teaching theoretical foundations of computer science. 36-53
Volume 14, Number 4, Fall - Winter 1982
- Whitfield Diffie:
Cryptographic technology: fifteen year forecast. 38-57 - Dino Mandrioli:
On teaching theoretical foundations of Computer Science. 58-69 - John C. Cherniavsky:
Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979. 70-71 - Research advance abstracts. 72-83
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.