KFU. Card publication. F Ablayev Lower bounds for one-way probabilistic communication complexity and their application to space complexity Theoretical Computer Science 1996 157 (2), 139-159

- RUS
- 中文
- ES

F ABLAYEV LOWER BOUNDS FOR ONE-WAY PROBABILISTIC COMMUNICATION COMPLEXITY AND THEIR APPLICATION TO SPACE COMPLEXITY THEORETICAL COMPUTER SCIENCE 1996 157 (2), 139-159

Form of presentation

Articles in international journals and collections

Year of publication

1996

Authors, employees of KFU

Ablaev Farid Mansurovich, author

Bibliographic description in the original language

F Ablayev Lower bounds for one-way probabilistic communication complexity and their application to space complexity Theoretical Computer Science 1996 157 (2), 139-159

The name of the journal

THEOR COMPUT SCI

Publishing house

Elsevier

URL

http://www.sciencedirect.com/science/article/pii/0304397595001573

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.date.accessioned	1996-01-01T00:00:00Z	ru_RU
dc.date.available	1996-01-01T00:00:00Z	ru_RU
dc.date.issued	1996	ru_RU
dc.identifier.citation	F Ablayev Lower bounds for one-way probabilistic communication complexity and their application to space complexity Theoretical Computer Science 1996 157 (2), 139-159	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=60546&p_lang=2	ru_RU
dc.description.abstract	THEOR COMPUT SCI	ru_RU
dc.language.iso	ru	ru_RU
dc.publisher	Elsevier	ru_RU
dc.title	F Ablayev Lower bounds for one-way probabilistic communication complexity and their application to space complexity Theoretical Computer Science 1996 157 (2), 139-159	ru_RU
dc.type	Articles in international journals and collections	ru_RU