Skip to content

Opening book details…

About this Computer Science article

Post's Problem for Reducibilities of Bounded Complexity by Valeriy K. Bulitko is a Computer Science article available to read on EtoBox.

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

Author
Valeriy K. Bulitko
Publisher
John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Ltd.; Wiley (ISSN 0044-3050)
Published
2002
Field
Computer Science (Physical Sciences)

More by Valeriy K. Bulitko

Browse all works by Valeriy K. Bulitko