🚀 go-pugleaf

$B$^$?$^$?!"(JP=NP$B$r>ZL@$7$?!"$H<gD%$9$kJs9p$,8=$l$?$h$&$G$9!#(J

[1] Gismondi, S.J. and Swart, E.R.,
``A polynomial-time procedure for resolving the graph isomophism problem'',
Research Report, Department of Computing and Information Science,
University of Guelph, CIS92-D4 (September 1992).

[2] Swart, E.R. and Gismondi, S.J.,
``N=1'',
Research Report, Department of Computing and Information Science,
University of Guelph, CIS92-D5 (September 1992).

[3] Gismondi, S.J. and Swart, E.R.,
``A polynomial-time solution to the Travelling Salesperson Problem'',
Research Report, Department of Computing and Information Science,
University of Guelph, CIS92-D6 (September 1992).

[1]$B$G$O(JKarmarkar$BK!$rMxMQ$7$F(JGI$B$,(JP$B$KB0$9$k$3$H$r!V>ZL@!W$7!"(J
[2]$B$G(JP=NP$B$r!"(J[3]$B$G(JTSP$B$KBP$7$FB?9`<0;~4V%"%k%4%j%:%`$rM?$($F$$$k$h$&$G$9!#(J

snowhite.cis.uoguelph.ca:~ftp/pub/comptheory
$B$K(JPostScript$B%U%!%$%k$,$"$j$^$9!#(J

-- 
$B6b(J $BEl8W(J
--
$B0-$I$$!":#$@$K!"1xL>HT2s!"40JI!"6=L#?<!9!"(JX'mas$B!"$=$N$H$&$j!"FbB!%b%G(J
$B%`!"Gn;N2aDx!"OC$7!"4V0c$(!"E*$rF@$k!#(J