KFU. Card publication. Qauntum Branching Programs Complexity for Certain Fundamental Computational Problems

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

QAUNTUM BRANCHING PROGRAMS COMPLEXITY FOR CERTAIN FUNDAMENTAL COMPUTATIONAL PROBLEMS

Form of presentation

Russian monographs

Year of publication

2004

��

��

Authors, employees of KFU

Khasyanov Ayrat Faridovich, author

Bibliographic description in the original language

Airat Khasianov, Qauntum Branching Programs Complexity for Certain Fundamental Computational Problems // Proc. of International Conference on Current Problems of Mathematics and Mechanics. - Kazan , 2004)

Keywords

Branching programs, computer science, complexity theory

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=154652&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Khasyanov Ayrat Faridovich	ru_RU
dc.date.accessioned	2004-01-01T00:00:00Z	ru_RU
dc.date.available	2004-01-01T00:00:00Z	ru_RU
dc.date.issued	2004	ru_RU
dc.identifier.citation	Airat Khasianov, Qauntum Branching Programs Complexity for Certain Fundamental Computational Problems // Proc. of International Conference on Current Problems of Mathematics and Mechanics. - Kazan , 2004)	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=154652&p_lang=2	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Branching programs	ru_RU
dc.subject	computer science	ru_RU
dc.subject	complexity theory	ru_RU
dc.title	Qauntum Branching Programs Complexity for Certain Fundamental Computational Problems	ru_RU
dc.type	Russian monographs	ru_RU