<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2011-09-12 12:52:00Mathematics Morphisms Complexity classes Graph theory Mathematical logic Structure Universal algebra NP-completeness Graph homomorphism Bipartite graph Homomorphism NP |
Add to Reading List |
Part I: Introduction Part II: Solution The complexity of Sur-Hom(C∗4 ) Barnaby Martin and Dan¨ıel Paulusma![Smooth morphisms Peter Bruin 21 February 2007 Introduction The goal of this talk is to define smooth morphisms of schemes, which are one of the main ingredients in N´eron’s fundamental theorem [BLR, § 1.3, Theorem 1]](https://www.pdfsearch.io/img/06220acaa25af2084a13d2d5266b96f9.jpg "Smooth morphisms Peter Bruin 21 February 2007 Introduction The goal of this talk is to define smooth morphisms of schemes, which are one of the main ingredients in N´eron’s fundamental theorem [BLR, § 1.3, Theorem 1]")
![arXiv:1011.5788v2 [math.CO] 6 JanPaperfolding morphisms, planefilling curves, and fractal tiles Michel Dekking January 7, 2011](https://www.pdfsearch.io/img/2817b9959a3d7aab8f2753cffc80e1e9.jpg "arXiv:1011.5788v2 [math.CO] 6 JanPaperfolding morphisms, planefilling curves, and fractal tiles Michel Dekking January 7, 2011")
