Questions tagged [pedagogy]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
6 votes
1 answer

Why is 3-SAT used for proving NP-Completeness so often?

I was wondering why 3-SAT is often chosen as the candidate problem from which one reduces from to prove the NP-completeness of another algorithm. I've seen it justified in places such as K&T by ...
entangled_photon's user avatar
2 votes
0 answers

Does exist another models like CARDIAC, LMC and IPC?

I'm working with CARDIAC (Cardboard Illustrative Aid to Computation) that is a model created at Bell Labs in 1968 to explain students how the computers worked with the Von Neumann architecture to ...
Osvaldo Santos's user avatar
4 votes
0 answers

Is there a OSI model equivalent for describing the abstract layers present in performing a computation for an operating system?

In describing where a system vulnerability exists, I often find a need for a model that partitions a operating system and its components into abstraction layers. Similar to how the Open Systems ...
Gabriel Fair's user avatar
7 votes
3 answers

Simple cycles of length two in an undirected graph

Pedagogical question. Background A cycle in a graph can be defined as a sequence of vertices $v_1,\dots,v_n$ with $v_1=v_n$ such that, for each $i \in \{1,\dots,n-1\}$, the graph has an edge $(v_i,...
usul's user avatar
  • 4,129