|
NP on Logarithmic SpaceEasyChair Preprint 9555, version history | | Version | Date | Pages | Version notes |
|---|
| 1 | January 8, 2023 | 8 | | | 2 | January 9, 2023 | 8 | We changed a definition in the section "The Problems". | | 3 | January 9, 2023 | 8 | We guarantee the constraint that the independent set is "exactly" of size K | | 4 | January 10, 2023 | 8 | We fixed some small details before the paper would be considered for peer-review. | | 5 | January 15, 2023 | 8 | We used an undirected graph on the independent set problem. | | 6 | March 5, 2023 | 8 | We improved the definition of problem TAGAP acordding to the reference paper. | | 7 | April 30, 2023 | 7 | | | 8 | May 15, 2023 | 7 | We removed redundant content. | | 9 | July 21, 2023 | 8 | We changed the abstract and created the Conclusions section | | 10 | July 25, 2023 | 8 | We recover another variant of a possible proof of P = NP. | | 11 | July 30, 2023 | 10 | We changed abstract, keywords and content. | | 12 | August 3, 2023 | 7 | We change the problems but the result is the almost the same. | | 13 | August 6, 2023 | 7 | During a short talk about the paper, a mistaken detail was detected in the definition of the problem SUBSET PRODUCT (SP). | | 14 | August 15, 2023 | 7 | | | 15 | August 15, 2023 | 7 | We improved the last proof. | | 16 | August 16, 2023 | 7 | We explain better the composition of logarithmic reduction. | | 17 | August 17, 2023 | 7 | We improved some details. | | 18 | August 21, 2023 | 7 | We replace "We can done" by "We can do" on page 5 | | 19 | August 27, 2023 | 6 | | | 20 | August 30, 2023 | 6 | Last update at MICOPAM 2023 conference | | 21 | November 3, 2023 | 6 | Corrigendum to the Final Version for the Proceedings Book of MICOPAM 2023 |
Keyphrases: completeness, complexity classes, logarithmic space, polynomial time, reduction |
|
|
