- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Nigmatullin R. | |
| dc.date.accessioned | 2018-09-14T20:14:28Z | |
| dc.date.available | 2018-09-14T20:14:28Z | |
| dc.date.issued | 1987 | |
| dc.identifier.issn | 0304-3975 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/132256 | |
| dc.description.abstract | Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicability. The purpose of the models is to explain the difficulties of establishing high lower bounds on the complexity. © 1987. | |
| dc.relation.ispartofseries | Theoretical Computer Science | |
| dc.title | Models of lower-bounds proofs | |
| dc.type | Article | |
| dc.relation.ispartofseries-issue | 3 | |
| dc.relation.ispartofseries-volume | 52 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.relation.startpage | 239 | |
| dc.source.id | SCOPUS03043975-1987-52-3-SID0023536229 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.