SET PACKING
Pedagogical Contributions for Learning within the Scope of the Theory of Computation
DOI:
https://doi.org/10.20873/uft.2675-3588.2026.v7n2.p13-20Keywords:
Theory of Computation, Computational Complexity, NP-Completeness, Set Packing Problem, Polynomial ReductionAbstract
This work proposes a methodological and didactic approach for the reproduction and elucidation of the concepts of NP-Completeness and the inherent intractability of combinatorial problems, using the Set Packing Problem (SP) as a case study. The methodology consists of a detailed exposition of the problem, followed by the reproduction of the formal demonstration of SP's membership in the NP-Complete class, including the construction and analysis of its polynomial verifier and the step-by-step presentation of the polynomial reduction technique from CLIQUE to SP. The main result and contribution of this article is the development of pedagogical material that aims to enhance the integral understanding of Theory of Computation concepts, assisting the public in effectively assimilating the meaning of computational complexity.
Downloads
Published
How to Cite
License
Copyright (c) 2026 Emanuel Badaró Fonseca, Victhor Cabral Magalhães Magalhaes, Daniel Martins da Silva, Tanilson ias dos Santos
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish in this journal agree to the following terms:
- Authors retain copyright and grant the journal the right of first publication, with work simultaneously licensed under the Creative Commons Attribution License (CC BY-NC 4.0), allowing work sharing with acknowledgment of the work's authorship and initial publication in this journal. ;
- Authors are authorized to enter additional contracts separately for the non-exclusive distribution of the version of the work published in this journal (eg, publishing in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal;
- Authors are allowed and encouraged to post and distribute their work online (eg, in institutional repositories or on their personal page) at any point after the editorial process;
- In addition, the AUTHOR is informed and agrees with the journal that, therefore, his paper may be incorporated by the AJCEAM into existing or existing scientific information systems and databases (indexers and databases). in the future (indexers and future databases), under the conditions defined by the latter at all times, which will involve at least the possibility that the holders of these databases may perform the following actions on the paper:
- Reproduce, transmit and distribute the paper in whole or in part in any form or means of existing or future electronic transmission, including electronic transmission for research, viewing and printing purposes;
- Reproduce and distribute all or part of the article in print;
- Translate certain parts of the paper;
- Extract figures, tables, illustrations, and other graphic objects and capture metadata, captions, and related article for research, visualization, and printing purposes;
- Transmission, distribution, and reproduction by agents or authorized by the owners of database distributors;
- The preparation of bibliographic citations, summaries and indexes and related capture references from selected parts of the paper;
- Scan and/or store electronic article images and text.
