- Tytuł:
- Time Complexity Reduction of Hard Problems
- Autorzy:
-
Jarosz, Janusz
Jaworski, Jerzy. - Powiązania:
- https://bibliotekanauki.pl/articles/748628.pdf
- Data publikacji:
- 1986
- Wydawca:
- Polskie Towarzystwo Matematyczne
- Tematy:
- Analysis of algorithms and problem complexity
- Opis:
-
.
The metodology for reduction of the time complexity for a wide class of hard problems is presented. Some open problems connected with the theoretical properties of computer tree (CT) are stated. The most important one consists in the deriving of the algorithms which can be solved in polynomial time using CT. - Źródło:
-
Mathematica Applicanda; 1986, 14, 28
1730-2668
2299-4009 - Pojawia się w:
- Mathematica Applicanda
- Dostawca treści:
- Biblioteka Nauki
Artykuł