KFU. Card publication. Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

STRONGER LOWER BOUNDS ON QUANTUM OBDD FOR THE HIDDEN SUBGROUP PROBLEM

Form of presentation

Articles in international journals and collections

Year of publication

2010

Язык

английский

Authors, employees of KFU

Khasyanov Ayrat Faridovich, author

Bibliographic description in the original language

A. Khasianov, Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem, Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 30. 2010

Annotation

Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 30. 2010

Keywords

Quantum branching programs, complexity theory, branching programs, computer science

The name of the journal

Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 30. 2010

URL

http://nbn-resolving.de/urn:nbn:de:hbz:5N-05696.

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Khasyanov Ayrat Faridovich	ru_RU
dc.date.accessioned	2010-01-01T00:00:00Z	ru_RU
dc.date.available	2010-01-01T00:00:00Z	ru_RU
dc.date.issued	2010	ru_RU
dc.identifier.citation	A. Khasianov, Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem, Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 30. 2010	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=154864&p_lang=2	ru_RU
dc.description.abstract	Electronic Colloquium on Computational Complexity, Revision 2 of Report No. 30. 2010	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Quantum branching programs	ru_RU
dc.subject	complexity theory	ru_RU
dc.subject	branching programs	ru_RU
dc.subject	computer science	ru_RU
dc.title	Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem	ru_RU
dc.type	Articles in international journals and collections	ru_RU