Hitting Set

Pedagogical Contributions for Learning within the Scope of Theory of Computation

Authors

DOI:

https://doi.org/10.20873/uft.2675-3588.2026.v7n2.p71-80

Keywords:

Hitting Set, NP-Complete, Vertex Cover, Polynomial Reduction, Theory of Computation

Abstract

This paper presents a pedagogical approach to the study of the Hitting Set problem, aiming to reproduce and make accessible the classic demonstration of its NP-completeness, as established in the specialized literature. Unlike works aiming to propose novel theoretical results, the central objective of this research is to bridge a didactic gap by meticulously detailing the polynomial reduction from the Vertex Cover problem to the Hitting Set problem. The adopted methodology begins with a review of fundamental concepts, including formal definitions of the P and NP classes, as well as the concepts of certificates and efficient verification. Subsequently, a proof inspired by Richard Karp is constructed step-by-step, emphasizing the visualization of transforming graph instances into set collections using “before and after” diagrams. Additionally, the “Observer's Dilemma” is introduced—an original analogy to illustrate combinatorial complexity. Finally, practical applications in bioinformatics and software engineering are discussed, consolidating the material as an effective support resource for teaching Theory of Computation.

Author Biography

Tanilson Dias dos Santos, Universidade Federal do Tocantins

Professor do Curso de Ciência da Computação - UFT. Doutor em Engenharia de Sistemas e Computação pelo PESC/COPPE-UFRJ. Possui Mestrado em Sistemas e Computação pelo Instituto Militar de Engenharia (IME,2014). É também pesquisador da área de Teoria dos Grafos e Teoria da Computação. Possuo graduação em Ciência da Computação e tem interesse de estudo nas áreas de Inteligência Artificial, Grafos, Otimização e Autômatos. Participou, anteriormente, do projeto de futebol de robôs na liga de simulação 2D. Possuo Certificação Internacional em Teste de Qualidade de Software, em exame realizado pela BSTQB, no nível CTFL (Foudation Level).

Published

2026-02-10

How to Cite

[1]
Melo Póvoa, J.P. et al. 2026. Hitting Set: Pedagogical Contributions for Learning within the Scope of Theory of Computation. Academic Journal on Computing, Engineering and Applied Mathematics. 7, 2 (Feb. 2026), 71–80. DOI:https://doi.org/10.20873/uft.2675-3588.2026.v7n2.p71-80.

Issue

Section

Special Issue

Categories

Most read articles by the same author(s)

Similar Articles

1 2 3 4 > >> 

You may also start an advanced similarity search for this article.