NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 2 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Gal-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
International Association for Development of the Information Society, 2012
The IADIS CELDA 2012 Conference intention was to address the main issues concerned with evolving learning processes and supporting pedagogies and applications in the digital age. There had been advances in both cognitive psychology and computing that have affected the educational arena. The convergence of these two disciplines is increasing at a…
Descriptors: Academic Achievement, Academic Persistence, Academic Support Services, Access to Computers