Электронный архив

Просмотр по теме "Complexity"

Просмотр по теме "Complexity"

Отсортировать по:Сортировать:Результаты поиска на странице:

  • Classical and quantum computations with restricted memory 
    Неизвестный автор (2018)
    © 2018, Springer Nature Switzerland AG. Automata and branching programs are known models of computation with restricted memory. These models of computation were in focus of a large number of researchers during the last ...
  • Comparative power of quantum and classical computation models 
    Ablayev F. (2005)
    In the talk we present results on comparitve power of classical and quantum computational models. We focus on two well known in Computer Science models: finite automata which is known as uniform computational model and ...
  • NAFASS in action: How to control randomness? 
    Nigmatullin R.; Zhang W. (2013)
    In this paper the original method of transformation of one random function to another one is suggested. The problem of transformation of one random function to another one is based on the NAFASS approach suggested previously ...
  • On classical simulation of quantum machines 
    Ablayev F.; Gainutdinova A. (2005)
    We present a classical probabilistic simulation technique of quantum Turing machines. As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP ...

Поиск в электронном архиве

Просмотр

Моя учетная запись