Geodesic
Time Complexity Reduction of Hard Problems
Mathematica Applicanda, Tome 14 (1986) no. 28, pp. 125-138.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

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.
DOI : 10.14708/ma.v14i28.1679
Classification : 68Q25
Mots-clés : Analysis of algorithms and problem complexity 
@article{10_14708_ma_v14i28_1679,
     author = {Janusz Jarosz and Jerzy. Jaworski},
     title = {Time {Complexity} {Reduction} of {Hard} {Problems}},
     journal = {Mathematica Applicanda},
     pages = { 125--138},
     publisher = {mathdoc},
     volume = {14},
     number = {28},
     year = {1986},
     doi = {10.14708/ma.v14i28.1679},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1679/}
}
TY  - JOUR
AU  - Janusz Jarosz
AU  - Jerzy. Jaworski
TI  - Time Complexity Reduction of Hard Problems
JO  - Mathematica Applicanda
PY  - 1986
SP  -  125
EP  - 138
VL  - 14
IS  - 28
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1679/
DO  - 10.14708/ma.v14i28.1679
LA  - pl
ID  - 10_14708_ma_v14i28_1679
ER  - 
%0 Journal Article
%A Janusz Jarosz
%A Jerzy. Jaworski
%T Time Complexity Reduction of Hard Problems
%J Mathematica Applicanda
%D 1986
%P  125-138
%V 14
%N 28
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1679/
%R 10.14708/ma.v14i28.1679
%G pl
%F 10_14708_ma_v14i28_1679
Janusz Jarosz; Jerzy. Jaworski. Time Complexity Reduction of Hard Problems. Mathematica Applicanda, Tome 14 (1986) no. 28, pp.  125-138. doi : 10.14708/ma.v14i28.1679. http://geodesic.mathdoc.fr/articles/10.14708/ma.v14i28.1679/

Cité par Sources :