Explore >> Select a destination
|
You are here 
|
yufeizhao.wordpress.com | ||
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | (After I wrote this post Lance tweeted a pointer to a great talk by Ronald de Wolf with more examples, and also examples of quantum proofs, ... | |
| | | | |
dominiczypen.wordpress.com
|
|
| | | | | Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$... | |
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | | | The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... | |
| | | | |
blog.invgate.com
|
|
| | | Understanding artificial intelligence is understanding the future of work. You've heard all about AI from all manner of sources. Let's dig into what it actually is. | ||
