| LDR | | 01636nam u200409 4500 |
| 001 | | 000000421981 |
| 005 | | 20190215165746 |
| 008 | | 181129s2018 |||||||||||||||||c||eng d |
| 020 | |
▼a 9780438290693 |
| 035 | |
▼a (MiAaPQ)AAI10824902 |
| 035 | |
▼a (MiAaPQ)ucdavis:17908 |
| 040 | |
▼a MiAaPQ
▼c MiAaPQ
▼d 247004 |
| 082 | 0 |
▼a 510 |
| 100 | 1 |
▼a Samperton, Eric Griffin. |
| 245 | 10 |
▼a Computational Complexity of Enumerative 3-manifold Invariants. |
| 260 | |
▼a [S.l.]:
▼b University of California, Davis.,
▼c 2018. |
| 260 | 1 |
▼a Ann Arbor:
▼b ProQuest Dissertations & Theses,
▼c 2018. |
| 300 | |
▼a 88 p. |
| 500 | |
▼a Source: Dissertation Abstracts International, Volume: 80-01(E), Section: B. |
| 500 | |
▼a Adviser: Greg Kuperberg. |
| 502 | 1 |
▼a Thesis (Ph.D.)--University of California, Davis, 2018. |
| 520 | |
▼a Fix a finite group G. We analyze the computational complexity of the problem of counting homomorphisms pi1(X) &rarr |
| 520 | |
▼a Both proofs proceed by studying the action of the pointed mapping class group MCG*(Sigma) on the set of homomorphisms {pi1(Sigma) &rarr |
| 590 | |
▼a School code: 0029. |
| 650 | 4 |
▼a Mathematics. |
| 650 | 4 |
▼a Computer science. |
| 690 | |
▼a 0405 |
| 690 | |
▼a 0984 |
| 710 | 20 |
▼a University of California, Davis.
▼b Mathematics. |
| 773 | 0 |
▼t Dissertation Abstracts International
▼g 80-01B(E). |
| 773 | |
▼t Dissertation Abstract International |
| 790 | |
▼a 0029 |
| 791 | |
▼a Ph.D. |
| 792 | |
▼a 2018 |
| 793 | |
▼a English |
| 856 | 40 |
▼u http://www.riss.kr/pdu/ddodLink.do?id=T14998710
▼n KERIS
▼z 이 자료의 원문은 한국교육학술정보원에서 제공합니다. |
| 980 | |
▼a 201812
▼f 2019 |
| 990 | |
▼a ***1012033 |