KFU. Card publication. Complexity issues for preorders on finite labeled forests

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

COMPLEXITY ISSUES FOR PREORDERS ON FINITE LABELED FORESTS

Form of presentation

Articles in international journals and collections

Year of publication

2014

Язык

английский

Authors, employees of KFU

Selivanov Viktor Lvovich, author

Other authors

Hertling Peter , author

Bibliographic description in the original language

Hertling P. Complexity issues for preorders on finite labeled forests / P. Hertling, V. Selivanov // Logic, Computation, Hierarchies, edited by Vasco Brattka, Hannes Diener, and Dieter Spreen. - Ontos Publishing, de Gruiter, Boston-Berlin, 2014. - P. 165-190.

Annotation

Logic, Computation, Hierarchies (edited by Vasco Brattka, Hannes Diener, and Dieter Spreen)

Keywords

Word, labeled forest, homomorphic quasiorder, polynomial time.

The name of the journal

Logic, Computation, Hierarchies (edited by Vasco Brattka, Hannes Diener, and Dieter Spreen)

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

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

Full metadata record

Field DC	Value	Language
dc.contributor.author	Selivanov Viktor Lvovich	ru_RU
dc.contributor.author	Hertling Peter	ru_RU
dc.date.accessioned	2014-01-01T00:00:00Z	ru_RU
dc.date.available	2014-01-01T00:00:00Z	ru_RU
dc.date.issued	2014	ru_RU
dc.identifier.citation	Hertling P. Complexity issues for preorders on finite labeled forests / P. Hertling, V. Selivanov // Logic, Computation, Hierarchies, edited by Vasco Brattka, Hannes Diener, and Dieter Spreen. - Ontos Publishing, de Gruiter, Boston-Berlin, 2014. - P. 165-190.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=181622&p_lang=2	ru_RU
dc.description.abstract	Logic, Computation, Hierarchies (edited by Vasco Brattka, Hannes Diener, and Dieter Spreen)	ru_RU
dc.description.abstract	We study computational complexity of some problems of popular structures on words and forests, concentrating on problems solvable in polynomial time	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Word	ru_RU
dc.subject	labeled forest	ru_RU
dc.subject	homomorphic quasiorder	ru_RU
dc.subject	polynomial time.	ru_RU
dc.title	Complexity issues for preorders on finite labeled forests	ru_RU
dc.type	Articles in international journals and collections	ru_RU