Explore >> Select a destination
|
You are here 
|
vzn1.wordpress.com | ||
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,... | |
| | | | |
thatsmaths.com
|
|
| | | | | In his book A Mathematician's Apology, leading British mathematician G H Hardy wrote "Amathematician, like a painter or poet, is a maker ofpatterns." He observed that the mathematician's patterns, like the painter's or the poet's, must be beautiful; beauty is the acid test [TM245or search for "thatsmaths" atirishtimes.com]. Everyone is familiar with the concept of... | |
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | The following excerpt from Abrahim Ladha's comment on Lance's post about AI and intro theory caught my attention: ------------------------... | |
| | | | |
brewminate.com
|
|
| | | The guild existed to serve a singular purpose: to train Apprentices. By Kristine Wilson-SlackWriter I became fascinated with | ||
