Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940064 / rank
 
Normal rank

Revision as of 11:12, 10 June 2024

scientific article
Language Label Description Also known as
English
Theory of computational complexity. Part 7. Transl. from the Russian
scientific article

    Statements

    Theory of computational complexity. Part 7. Transl. from the Russian (English)
    0 references
    8 June 2005
    0 references
    The articles of this volume are translations from the series ``Zap. Nauchn. Semin. POMI 293 (2002; Zbl 1063.68504)'' and will be reviewed individually. The preceding collection (4, 1989) has been reviewed (see Zbl 0685.00025).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers