覆盖所有子问题的最小问题数

Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences Pub Date : 1970-10-01 DOI:10.6028/jres.074b.023

H. J. Greenberg

{"title":"覆盖所有子问题的最小问题数","authors":"H. J. Greenberg","doi":"10.6028/jres.074b.023","DOIUrl":null,"url":null,"abstract":"Th e fo ll ow ing proble m is motiva te d and the n so lved, using the theo ry of sys tems of di s tinct re presentatives . Le t 111 = {I . 2 . . , III}. a nd for each sequ e nce u of di s tinc t me mbers of 111, le t (u ) be th e assoc ia te d subse t. S uppose give n a mathe mati ca l probl e m 1' (5) for e ac h s ubset 5 of 111, and a n a lgo rithm A whi c h whe n a ppli ed to u so lves not on ly 1'( (u» b ut a lso all 1' ( (0») where T is an initi a l segme nt of u. What is the s malles t numbe r of a pplicat ions of A need ed to solve the e ntire e nse mble of prob le ms { p (S):S C ilf }?","PeriodicalId":166823,"journal":{"name":"Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1970-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The minimum number of problems to cover all subproblems\",\"authors\":\"H. J. Greenberg\",\"doi\":\"10.6028/jres.074b.023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Th e fo ll ow ing proble m is motiva te d and the n so lved, using the theo ry of sys tems of di s tinct re presentatives . Le t 111 = {I . 2 . . , III}. a nd for each sequ e nce u of di s tinc t me mbers of 111, le t (u ) be th e assoc ia te d subse t. S uppose give n a mathe mati ca l probl e m 1' (5) for e ac h s ubset 5 of 111, and a n a lgo rithm A whi c h whe n a ppli ed to u so lves not on ly 1'( (u» b ut a lso all 1' ( (0») where T is an initi a l segme nt of u. What is the s malles t numbe r of a pplicat ions of A need ed to solve the e ntire e nse mble of prob le ms { p (S):S C ilf }?\",\"PeriodicalId\":166823,\"journal\":{\"name\":\"Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences\",\"volume\":\"171 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6028/jres.074b.023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6028/jres.074b.023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力，有了新的动力。Le t 111 = I二,第三舰队的。a和e为每sequ nce u of t在s tinc我mbers of t 111, le d (u)成为th e assoc他te subse t . s . uppose给n a妈妈死ca我问题e m 1”(5)为e h s ubset 5 111的空调,和a n lgo rithm a whi c h whe n a ppli艾德to u所以艾夫斯不是在ly 1”(u。b ut lso # 1”(0。)t是一个地方initi a l segme nt。什么是《美国之malles t r a的号码pplicat ions《e ntire e a需要艾德-骗人的nse的mble prob le {p (s): c ilf女士了吗?

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The minimum number of problems to cover all subproblems

Th e fo ll ow ing proble m is motiva te d and the n so lved, using the theo ry of sys tems of di s tinct re presentatives . Le t 111 = {I . 2 . . , III}. a nd for each sequ e nce u of di s tinc t me mbers of 111, le t (u ) be th e assoc ia te d subse t. S uppose give n a mathe mati ca l probl e m 1' (5) for e ac h s ubset 5 of 111, and a n a lgo rithm A whi c h whe n a ppli ed to u so lves not on ly 1'( (u» b ut a lso all 1' ( (0») where T is an initi a l segme nt of u. What is the s malles t numbe r of a pplicat ions of A need ed to solve the e ntire e nse mble of prob le ms { p (S):S C ilf }?

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Research of the National Bureau of Standards, Section B: Mathematical Sciences

自引率

0.00%

发文量