StackRating

An Elo-based rating system for Stack Overflow

Home | About | Stats and Analysis | Get a Badge

Answers and rating deltas for

Let A be NP-complete and B be NP-hard. Can B be polynomial time reducible to A?

Author	Votes	Δ
Abhishek Keshri	1	0.00

Last visited: Jul 12, 2018, 11:19:02 AM