V. M. Khrapchenko

From MaRDI portal
Person:1215613

Available identifiers

zbMath Open khrapchenko.v-mMaRDI QIDQ1215613

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q52397042019-10-22Paper
https://portal.mardi4nfdi.de/entity/Q52397162019-10-22Paper
A simplified proof of a lower complexity estimate2014-02-04Paper
https://portal.mardi4nfdi.de/entity/Q31156262012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31156312012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q35892772010-09-20Paper
The fundamental difference between depth and delay2009-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44995332000-08-30Paper
New inequality relations between depth and delay1996-08-12Paper
https://portal.mardi4nfdi.de/entity/Q37104701984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36745531981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39104491979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30503191978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38551201978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39052091978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30503181976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47686281973-01-01Paper
The complexity of the realization of symmetrical functions by formulae1972-01-01Paper
Method of determining lower bounds for the complexity of \(\Pi\)-circuits1972-01-01Paper
Complexity of the realization of a linear function in the class of \(\Pi\)-circuits1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56066011971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56292391971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55834721967-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: V. M. Khrapchenko