Generic properties of a computational task predict human effort and performance
type: Item
instance of: scholarly article
title: Generic properties of a computational task predict human effort and performance
zbMATH Open document ID: 1479.91081
author: Juan Pablo Franco
author: Peter Bossaerts
author: Carsten Murawski
author: Nitin Kumar Yadav
published in: Journal of Mathematical Psychology
publication date: 2021-12-17T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7447270
zbMATH Keywords: decision-making
zbMATH Keywords: computational complexity
zbMATH Keywords: typical-case complexity
zbMATH Keywords: knapsack problem
zbMATH Keywords: problem solving
MaRDI profile type: Publication
full work available at URL: j.jmp.2021.102592
OpenAlex ID: W3196960964
cites work: On the solution‐space geometry of random constraint satisfaction problems
cites work: Computational Complexity
cites work: Computational complexity in non-Turing models of computation: the what, the why and the how
cites work: Q3413362
cites work: Biased landscapes for random constraint satisfaction problems
cites work: Q4012216
cites work: Tractable competence
cites work: The TSP phase transition
cites work: Prospect Theory: An Analysis of Decision under Risk
cites work: Q4821303
cites work: Gibbs states and the set of solutions of random constraint satisfaction problems
cites work: Determining computational complexity from characteristic ‘phase transitions’
cites work: Q3090774
cites work: Q5200674
cites work: Logical Foundations of Mathematics and Computational Complexity
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: Critical behavior in the computational cost of satisfiability testing
cites work: Advances in prospect theory: cumulative representation of uncertainty
cites work: Theory of games and economic behavior.
DOI: 10.1016/J.JMP.2021.102592
description: scientific article; zbMATH DE number 7447270