البيان رقم صفر

Home

❯

refs

❯

Reducibility among Combinatorial Problems

Reducibility among Combinatorial Problems

Karp, Richard M., ‘Reducibility among Combinatorial Problems’, Complexity of Computer Computations, (IBM Thomas J. Watson Research Centre, Yorktown Heights, New York), edited by Miller, Raymond E., James W. Thatcher, and Jean D. Bohlinger, Boston, MA: Springer US, no date[a], pp 85–103.

conference paper · https://doi.org/10.1007/978-1-4684-2001-2_9


Graph View

Backlinks

  • Richard M. Karp
  • Complexity of Computer Computations
  • Some varieties of idealisation
  • The asymptotics of language