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

Home

❯

Reducibility among Combinatorial Problems

Reducibility among Combinatorial Problems

Karp, Richard M., ‘Reducibility among Combinatorial Problems’, Complexity of Computer Computations, edited by Raymond E. Miller, James W. Thatcher et al., no date[a], pp 85–103.

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


Backlinks

Thesis. The asymptotics of language

1 August 2026

Note. Some varieties of idealisation

27 April 2026