SIS PUT | The Simplified Partial Digest Problem: Complexity and Algorithms

Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Menu

Scientific Information System of the Poznań University of Technology

PL EN

Main page / Dissertations / The Simplified Partial Digest Problem: Complexity and Algorithms

Submit a comment

Dissertation

Download BibTeX

Title

The Simplified Partial Digest Problem: Complexity and Algorithms

Authors

Alexandr Kovalev

Promoter

Jacek Błażewicz ^{[ 1 ][ P ]}

^{[ 1 ]} Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | ^{[ P ]} employee

Reviewers

Piotr Formanowicz ^{[ 1 ][ P ]}
Jerzy Tiuryn

^{[ 1 ]} Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | ^{[ P ]} employee

Title variant

PL Problem mapowania metodą uproszczonego częściowego trawienia: złożoność i algorytmy

Language

english

Number of pages

101

Signature of printed version

DrOIN 1091

On-line catalog

Full text of dissertation

no permission to download file

Access level to full text

archive

First review

Piotr Formanowicz

Place

Poznań, Polska

Date

28.08.2008

Language

polish

Review text

no permission to download file

Access level to review text

archive

Second review

Jerzy Tiuryn

Place

Warszawa, Polska

Date

26.08.2008

Language

polish

Review text

no permission to download file

Access level to review text

archive

Dissertation status

dissertation

Place of defense

Poznań, Polska

Date of defense

29.09.2008

System created by Poznań University of Technology and Poznan Supercomputing and Networking Center

Log in through eKonto to add to SIS

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.