ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (Q5151450): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5583472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the realization of a linear function in the class of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the realization of symmetrical functions by formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4768628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inequality relations between depth and delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3589277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental difference between depth and delay / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified proof of a lower complexity estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5239704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5239716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network delay in a model with inputs of functional elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4866339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the formula complexity of a linear Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and depth of formulas for symmetric Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth and polynomial equivalence of formulas for closed classes of two- valued logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5827965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addition of Binary Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoff in monotone Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-depth tradeoff in non-monotone Boolean formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parallel Evaluation of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for parallel polynomial evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shallow circuits and concise formulae for multiple addition and multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Evaluation of Boolean Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelizable algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank

Latest revision as of 15:34, 24 July 2024

scientific article; zbMATH DE number 7312020
Language Label Description Also known as
English
ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO
scientific article; zbMATH DE number 7312020

    Statements

    ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO (English)
    0 references
    0 references
    0 references
    17 February 2021
    0 references
    depth
    0 references
    circuit delay
    0 references
    Khrapchenko method
    0 references
    lower complexity bounds
    0 references
    parallel adder
    0 references
    symmetric functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers