Publication Date
| In 2025 | 0 |
| Since 2024 | 0 |
| Since 2021 (last 5 years) | 0 |
| Since 2016 (last 10 years) | 1 |
| Since 2006 (last 20 years) | 1 |
Descriptor
| Computation | 1 |
| Computer Science Education | 1 |
| Concept Mapping | 1 |
| Difficulty Level | 1 |
| Foreign Countries | 1 |
| Misconceptions | 1 |
| Problem Solving | 1 |
| Undergraduate Students | 1 |
Source
| Computer Science Education | 1 |
Publication Type
| Journal Articles | 1 |
| Reports - Evaluative | 1 |
Education Level
| Higher Education | 1 |
| Postsecondary Education | 1 |
Audience
Location
| Israel | 1 |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewed
Direct linkGal-Ezer, Judith; Trakhtenbrot, Mark – Computer Science Education, 2016
Reduction is one of the key techniques used for problem-solving in computer science. In particular, in the theory of computation and complexity (TCC), mapping and polynomial reductions are used for analysis of decidability and computational complexity of problems, including the core concept of NP-completeness. Reduction is a highly abstract…
Descriptors: Computer Science Education, Problem Solving, Computation, Difficulty Level
