Time Complexity Reduction of Hard Problems
Janusz Jarosz; Jerzy. Jaworski
Mathematica Applicanda (1986)
- Volume: 14, Issue: 28
- ISSN: 1730-2668
Access Full Article
top
Abstract
topHow to cite
topJanusz Jarosz, and Jerzy. Jaworski. "Time Complexity Reduction of Hard Problems." Mathematica Applicanda 14.28 (1986): null. <http://eudml.org/doc/292803>.
@article{JanuszJarosz1986,
abstract = {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.},
author = {Janusz Jarosz, Jerzy. Jaworski},
journal = {Mathematica Applicanda},
keywords = {Analysis of algorithms and problem complexity},
language = {eng},
number = {28},
pages = {null},
title = {Time Complexity Reduction of Hard Problems},
url = {http://eudml.org/doc/292803},
volume = {14},
year = {1986},
}
TY - JOUR
AU - Janusz Jarosz
AU - Jerzy. Jaworski
TI - Time Complexity Reduction of Hard Problems
JO - Mathematica Applicanda
PY - 1986
VL - 14
IS - 28
SP - null
AB - 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.
LA - eng
KW - Analysis of algorithms and problem complexity
UR - http://eudml.org/doc/292803
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.