| 相似文献(共20条): | | [1]、 | Zihan Tan.On the computational complexity of bridgecard[J].Journal of Combinatorial Optimization,2016,31(1):196-217. | | [2]、 | Wenbin Chen,Matthew C. Schmidt,Nagiza F. Samatova.On the parameterized complexity of the Multi-MCT and Multi-MCST problems[J].Journal of Combinatorial Optimization,2011,21(2):151-158. | | [3]、 | Sun,Xiaoming,Sun,Yuan,Wu,Kewen,Xia,Zhiyu.On the relationship between energy complexity and other boolean function measures[J].Journal of Combinatorial Optimization,2022,43(5):1470-1492. | | [4]、 | My T. Thai,Taieb Znati.On the complexity and approximation of non-unique probe selection using d-disjunct matrix[J].Journal of Combinatorial Optimization,2009,17(1):45-53. | | [5]、 | Donatella Granata,Behnam Behdani,Panos M. Pardalos.On the complexity of path problems in properly colored directed graphs[J].Journal of Combinatorial Optimization,2012,24(4):459-467. | | [6]、 | Hongyu Liang,Tiancheng Lou,Haisheng Tan,Yuexuan Wang,Dongxiao Yu.On the complexity of connectivity in cognitive radio networks through spectrum assignment[J].Journal of Combinatorial Optimization,2015,29(2):472-487. | | [7]、 | Julien Bensmail.On the complexity of partitioning a graph into a few connected subgraphs[J].Journal of Combinatorial Optimization,2015,30(1):174-187. | | [8]、 | JR King.Scheduling and the problem of computational complexity[J].Omega,1979,7(3):233-240. | | [9]、 | Liu C,Burge L,Blake A.Algorithms and time complexity of the request-service problem[J].Journal of Combinatorial Optimization,2010,20(2):180-193. | | [10]、 | Christoph Laubert,Ingmar Geiger.Disentangling complexity: how negotiators identify and handle issue-based complexity in business-to-business negotiation[J].Zeitschrift für Betriebswirtschaft,2018,88(9):1061-1103. | | [11]、 | Manfred Kochen.Coping with complexity[J].Omega,1980,8(1):11-20. | | [12]、 | Discretion and complexity in customer focused environments[J].European Management Journal | | [13]、 | Paola Bonizzoni,Gianluca Della Vedova,Riccardo Dondi,Yuri Pirola.Parameterized complexity of k-anonymity: hardness and tractability[J].Journal of Combinatorial Optimization,2013,26(1):19-43. | | [14]、 | Jaromír Kukal,Matej Mojzeš.Quantile and mean value measures of search process complexity[J].Journal of Combinatorial Optimization,2018,35(4):1261-1285. | | [15]、 | Yuliya Snihur,Jorge Tarzijan.Managing complexity in a multi-business-model organization[J].Long Range Planning,2018,51(1):50-63. | | [16]、 | Wang,Tianyu,Averbakh,Igor.Network construction/restoration problems: cycles and complexity[J].Journal of Combinatorial Optimization,2022,44(1):51-73. | | [17]、 | Xianmin Liu,Jianzhong Li.Algorithms and complexity results for labeled correlation clustering problem[J].Journal of Combinatorial Optimization,2015,29(2):488-501. | | [18]、 | D. S. Malyshev.A complexity dichotomy and a new boundary class for the dominating set problem[J].Journal of Combinatorial Optimization,2016,32(1):226-243. | | [19]、 | Ian Howarth.Applications of complexity theory to the management of human behaviour[J].Work and stress,1993,7(4):293-297. | | [20]、 | Ahmed M. Deif.Modelling and analysis of dynamic capacity complexity in multi-stage production[J].生产规划与管理,2013,24(8):737-749. |
|
