Time Complexity Reduction of Hard Problems

• Autorzy: Janusz Jarosz , Jerzy. Jaworski
• Języki publikacji: EN

Abstrakty

EN

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.

PL

.

Słowa kluczowe

EN

Analysis of algorithms and problem complexity

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1986
• Tom: 14
• Numer: 28

Daty

wydano

1986

online

2016-10-25

Twórcy

autor

Janusz Jarosz

autor

Jerzy. Jaworski

Identyfikatory

DOI

10.14708/ma.v14i28.1679