scientific article
From MaRDI portal
Publication:2744910
DOI10.1023/A:1017503201702zbMath0972.68690OpenAlexW2914559751MaRDI QIDQ2744910
Publication date: 18 November 2001
Published in: Minds and Machines (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017503201702
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in artificial intelligence (68T01)
Related Items (11)
Generic properties of a computational task predict human effort and performance ⋮ The Impact of Parameterized Complexity to Interdisciplinary Problem Solving ⋮ Intractability and the use of heuristics in psychological explanations ⋮ A fresh look at research strategies in computational cognitive science: the case of enculturated mathematical problem solving ⋮ Intractability and approximation of optimization theories of cognition ⋮ Unnamed Item ⋮ Parameterized complexity of theory of mind reasoning in dynamic epistemic logic ⋮ Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents ⋮ Sources of complexity in subset choice ⋮ The Computational Complexity of Quantified Reciprocals ⋮ Logic and Complexity in Cognitive Science
This page was built for publication:
