PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  złożoność algorytmu
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Noise effects in the quantum search algorithm from the viewpoint of computational complexity
Gawron P., Klamka J., Winiarczyk R.
International Journal of Applied Mathematics and Computer Science
|
2012
|
Vol. 22, no. 2
493-499
EN
We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.
2
Content available remote Under and exact estimates of complexity of algorithms for multi-peg tower of Hanoi problem
Novikov S.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2007
|
Vol. 12
87-96
EN
It is proved under and exact estimates of complexity of algorithms for the multi-peg Tower of Hanoi problem with the limited number of discs.
3
Content available remote Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms
Tarapata Z.
International Journal of Applied Mathematics and Computer Science
|
2007
|
Vol. 17, no 2
269-287
EN
The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multiobjective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra’s algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.
4
Content available remote Jeszcze o prostej dostatecznie grubej w odpowiedzi M. W. Gutowskiemu
Zięba A.
Postępy Fizyki
|
2003
|
T. 54, z. 3
123-127
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.