KFU. Card publication. F. Ablayev, A. Gainutdinova, Classical Simulation Complexity of Quantum Branching Programs // Proceedings of The 1st International Conference on Language and Automata Theory and Applications, LATA 2007 (Tarragona, Spain, March 29

- RUS
- 中文
- ES

F. ABLAYEV, A. GAINUTDINOVA, CLASSICAL SIMULATION COMPLEXITY OF QUANTUM BRANCHING PROGRAMS // PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, LATA 2007 (TARRAGONA, SPAIN, MARCH 29 - APRIL 4, 2007)

Form of presentation

Articles in international journals and collections

Year of publication

2007

Authors, employees of KFU

Ablaev Farid Mansurovich, author

Gaynutdinova Aida Faritovna, author

Bibliographic description in the original language

F. Ablayev, A. Gainutdinova, Classical Simulation Complexity of Quantum Branching Programs // Proceedings of The 1st International Conference on Language and Automata Theory and Applications, LATA 2007 (Tarragona, Spain, March 29 - April 4, 2007)

Annotation

Proceedings of The 1st International Conference on Language and Automata Theory and Applications

Place of publication

Tarragona

The name of the journal

Proceedings of The 1st International Conference on Language and Automata Theory and Applications

Publishing house

LNCS

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.contributor.author	Gaynutdinova Aida Faritovna	ru_RU
dc.date.accessioned	2007-01-01T00:00:00Z	ru_RU
dc.date.available	2007-01-01T00:00:00Z	ru_RU
dc.date.issued	2007	ru_RU
dc.identifier.citation	F. Ablayev, A. Gainutdinova, Classical Simulation Complexity of Quantum Branching Programs // Proceedings of The 1st International Conference on Language and Automata Theory and Applications, LATA 2007 (Tarragona, Spain, March 29 - April 4, 2007)	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=10746&p_lang=2	ru_RU
dc.description.abstract	Proceedings of The 1st International Conference on Language and Automata Theory and Applications	ru_RU
dc.description.abstract	Proceedings of The 1st International Conference on Language and Automata Theory and Applications	ru_RU
dc.language.iso	ru	ru_RU
dc.publisher	LNCS	ru_RU
dc.title	F. Ablayev, A. Gainutdinova, Classical Simulation Complexity of Quantum Branching Programs // Proceedings of The 1st International Conference on Language and Automata Theory and Applications, LATA 2007 (Tarragona, Spain, March 29 - April 4, 2007)	ru_RU
dc.type	Articles in international journals and collections	ru_RU