Is Hardness Inherent in Computational Problems? Performance of Human and Electronic Computers on Random Instances of the 0-1 Knapsack Problem
暂无分享,去创建一个
[1] Toby Walsh,et al. Easy Problems are Sometimes Hard , 1994, Artif. Intell..
[2] Jean,et al. The Computer and the Brain , 1989, Annals of the History of Computing.
[3] Toby Walsh,et al. The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.
[4] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[5] F. Manes,et al. “Ecological” and Highly Demanding Executive Tasks Detect Real-Life Deficits in High-Functioning Adult ADHD Patients , 2013, Journal of attention disorders.
[6] Peter Bossaerts,et al. Computational Complexity and Human Decision-Making , 2017, Trends in Cognitive Sciences.
[7] G. B. Mathews. On the Partition of Numbers , 1896 .
[8] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[9] Kate Smith-Miles,et al. Measuring instance difficulty for combinatorial optimization problems , 2012, Comput. Oper. Res..
[10] M. Bilodeau,et al. Theory of multivariate statistics , 1999 .
[11] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..
[12] Peter Bossaerts,et al. How Humans Solve Complex Problems: The Case of the Knapsack Problem , 2016, Scientific Reports.
[13] Toby Walsh,et al. Analysis of Heuristics for Number Partitioning , 1998, Comput. Intell..
[14] Peter Bossaerts,et al. Promoting Intellectual Discovery: Patents Versus Markets , 2009, Science.
[15] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[16] Peter J. Stuckey,et al. MiniZinc: Towards a Standard CP Modelling Language , 2007, CP.
[17] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[18] Maria Grazia Speranza,et al. Heuristic algorithms for the portfolio selection problem with minimum transaction lots , 1999, Eur. J. Oper. Res..
[19] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[20] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[21] Cristopher Moore,et al. The Nature of Computation , 2011 .
[22] Toby Walsh,et al. The TSP Phase Transition , 1996, Artif. Intell..
[23] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[24] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .