По вашему запросу найдено документов: 46089
Страница 1 из 4609
Execution for complex program set at the parallel computing systems time for complex program set at the parallel computing system with given or supposed computer
Classical and quantum computations with restricted memory of computation with restricted memory. These models of computation were in focus of a large number of researchers
The complexity of classical and quantum branching programs: A communication complexity approachWe present a survey of the communication point of view for a complexity lower bounds proof
Comparative power of quantum and classical computation modelsIn the talk we present results on comparitve power of classical and quantum computational models
On computational power of classical and quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP ⊆ PP-BP and BQP-BP ⊆ PP
On computational power of classical and quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP ⊆ PP-BP and BQP-BP ⊆ PP
FORECASTING THE EXECUTION OF COMPLEX SOFTWARE ON PARALLEL COMPUTER-SYSTEMS of complex software in a parallel computer system with a given or assumed resource configuration. The method
Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (Extended abstract) of bit complexity of computing solution operators for symmetric hyperbolic systems of PDEs. Here we
The complexity of classical and quantum branching programs: A communication complexity approachWe present a survey of the communication point of view for a complexity lower bounds proof
Computable isomorphisms of distributive lattices-theoretic complexity of equivalence relations is provided by computable reducibility. This gives rise to a rich degree
Страница 1 из 4609
Фасеты
Партнеры
Индексация
