Concepedia

Completeness Reductions

Completeness Reductions is a type of polynomial-time many-one reduction used in computational complexity theory that establishes the hardness of problems by mapping instances of a known complete problem to instances of a target problem while preserving the membership in a complexity class, thereby demonstrating that the target problem is at least as hard as the hardest problems in that class.

157

Publications

7.8K

Citations

289

Authors

185

Institutions

Publications per year

2017–2026

8

Parents

Publications

157

Reduction Techniques for Instance-Based Learning Algorithms

D.R. Wilson, Tony Martinez · Machine Learning · 2000 · 1.2K citations · Full text

, , +13

Formal Reductions of the General Combinatorial Decision Problem

Emil L. Post · American Journal of Mathematics · 1943 · 847 citations

, , +10

The node-deletion problem for hereditary properties is NP-complete

John M. Lewis, Mihalis Yannakakis · Journal of Computer and System Sciences · 1980 · 516 citations

, , +6

Complete Sets of Reductions for Some Equational Theories

Gerald E. Peterson, Mark E. Stickel · Journal of the ACM · 1981 · 413 citations · Full text

, , +7

Node-Deletion Problems on Bipartite Graphs

Mihalis Yannakakis · SIAM Journal on Computing · 1981 · 300 citations

, , +13

1–5 of 157

Authors

289

  1. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    4 publications · 157 citations

    4

    h-index

  2. LA
    Lane A. Hemachandra

    University of Rochester, United States

    3 publications · 113 citations

    3

    h-index

  3. SA
    Serge Abiteboul

    Institut national de recherche en sciences et technologies du numérique, France

    3 publications · 453 citations

    3

    h-index

  4. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    3 publications · 140 citations

    3

    h-index

  5. GG
    Gösta Grahne

    Concordia University, Canada

    3 publications · 453 citations

    3

    h-index

1–5 of 289

Institutions

185

  1. Cornell University

    Ithaca, United States

    8 h-index

    16 publications

    657 citations

  2. Centre National de la Recherche Scientifique

    Paris, France

    6 h-index

    6 publications

    185 citations

  3. University of Oxford

    Oxford, United Kingdom

    5 h-index

    7 publications

    135 citations

  4. Brown University

    Providence, United States

    4 h-index

    4 publications

    470 citations

  5. Boston University

    Boston, United States

    4 h-index

    5 publications

    142 citations

  6. Charles University

    Prague, Czechia

    3 h-index

    3 publications

    96 citations

  7. Institut national de recherche en sciences et technologies du numérique

    Le Chesnay-Rocquencourt, France

    3 h-index

    3 publications

    453 citations

  8. University of Helsinki

    Helsinki, Finland

    3 h-index

    3 publications

    453 citations

1–8 of 185

Venues

  1. SIAM Journal on Computing

    13 publications · 718 citations

    13

    h-index

  2. Theoretical Computer Science

    8 publications · 468 citations

    8

    h-index

  3. Information and Computation

    5 publications · 116 citations

    5

    h-index

  4. Discrete Mathematics

    4 publications · 60 citations

    4

    h-index

  5. Artificial Intelligence

    4 publications · 121 citations

    4

    h-index

1–5