Skip to content

Opening book details…

About this Computer Science article

Hyperenumeration reducibility. by Sanchis, Luis E. is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Sanchis, Luis E.
Publisher
University of Notre Dame; Duke University Press (ISSN 0029-4527)
Published
1978
Field
Computer Science (Physical Sciences)

More by Sanchis, Luis E.

Browse all works by Sanchis, Luis E.