首页 | 本学科首页   官方微博 | 高级检索  
     


New bounds on a hypercube coloring problem
Authors:Hung Quang Ngo  Ding-Zhu Du  Ronald L. Graham
Affiliation:a Department of Computer Science and Engineering, State University of New York, Buffalo, NY 14260, USA
b Department of Computer Science and Engineering, University of Minnesota, 200 Union street, EE/CS Building, room 4-192, Minneapolis, MN 55455, USA
c Department of Computer Science, University of California at San Diego, La Jolla, CA 92093, USA
Abstract:
Keywords:Combinatorial problems     mmlsi5"   class="  mathmlsrc"   onclick="  submitCitation('/science?_ob=MathURL&  _method=retrieve&  _eid=1-s2.0-S0020019002003010&  _mathId=si5.gif&  _pii=S0020019002003010&  _issn=00200190&  _acct=C000054348&  _version=1&  _userid=3837164&  md5=96e3c721f4bc6cdde521cad392ca69cf')"   style="  cursor:pointer  "   alt="  Click to view the MathML source"   title="  Click to view the MathML source"  >  formulatext"   title="  click to view the MathML source"  >n-cube   Coloring
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号