Generic properties of a computational task predict human effort and performance

DOI10.1016/j.jmp.2021.102592zbMath1479.91081OpenAlexW3196960964MaRDI QIDQ825138

Peter Bossaerts, Carsten Murawski, Juan Pablo Franco, Nitin Kumar Yadav

Publication date: 17 December 2021

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2021.102592

zbMATH Keywords

computational complexityknapsack problemproblem solvingdecision-makingtypical-case complexity

Mathematics Subject Classification ID

Decision theory (91B06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in prospect theory: cumulative representation of uncertainty
• The TSP phase transition
• Critical behavior in the computational cost of satisfiability testing
• Computational Complexity in Non-Turing Models of Computation
• Approximate Algorithms for the 0/1 Knapsack Problem
• Prospect Theory: An Analysis of Decision under Risk
• Logical Foundations of Mathematics and Computational Complexity
• Biased landscapes for random constraint satisfaction problems
• Computational Complexity
• Determining computational complexity from characteristic ‘phase transitions’
• Gibbs states and the set of solutions of random constraint satisfaction problems
• On the solution‐space geometry of random constraint satisfaction problems

This page was built for publication: Generic properties of a computational task predict human effort and performance