Модель дерева рішень (Ukrainian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Модель дерева рішень" in Ukrainian language version.

refsWebsite

Global rank Ukrainian rank

69^th place

188^th place

6^th place

6^th place

2^nd place

4^th place

archive.org

Tardos, G. (1989). Query complexity, or why is it difficult to separate NP^A ∩ coNP^A from P^A by random oracles A?. Combinatorica. 9: 385—392. doi:10.1007/BF02125350.

arxiv.org

Midrijanis, Gatis (2004), Exact quantum query complexity for total Boolean functions, arXiv:quant-ph/0403168, arXiv:quant-ph/0403168
Midrijanis, Gatis (2005), On randomized and quantum query complexities, arXiv:quant-ph/0501142, arXiv:quant-ph/0501142

doi.org

Tardos, G. (1989). Query complexity, or why is it difficult to separate NP^A ∩ coNP^A from P^A by random oracles A?. Combinatorica. 9: 385—392. doi:10.1007/BF02125350.