SciLogs » Heidelberg Laureate Forum » Computer Science » On Trial: P versus NP and the Complexity of Complexity » P_np_np-complete_np-hard
- By Benjamin Skuse
- Lesedauer ca. 1 Minute
- 0 comments
P_np_np-complete_np-hard
BLOG: Heidelberg Laureate Forum
Laureates of mathematics and computer science meet the next generation
Posted by Benjamin Skuse
Benjamin Skuse is a professional freelance writer of all things science. In a previous life, he was an academic, earning a PhD in Applied Mathematics from the University of Edinburgh and MSc in Science Communication. Now based in the West Country, UK, he aims to craft understandable, absorbing and persuasive narratives for all audiences – no matter how complex the subject matter. His work has appeared in New Scientist, Sky & Telescope, BBC Sky at Night Magazine, Physics World and many more.