7 ms·
I think the author makes the volume of mathematically inclined CS research seem smaller than it is. Once computational complexity was born as a field, no reputa
by j2kun 13y ago
I think the author makes the volume of mathematically inclined CS research seem smaller than it is. Once computational complexity was born as a field, no reputable algorithm was published without a strong analysis by combinatorial optimization experts and complexity theorists. And now terms like 2-approximation algorithm and NP-hard are standard measures.