Completeness Classes in Algebra

@inproceedings{Valiant1979CompletenessCI,
  title={Completeness Classes in Algebra},
  author={Leslie G. Valiant},
  booktitle={STOC},
  year={1979}
}
In the theory of recursive functions and computational complexity it has been demonstrated repeatedly that the natural problems tend to cluster together in “completeness classes”. These are families of problems that (A) are computationally interreducible and (B) are the hardest members of some computationally defined class. The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 429 citations. REVIEW CITATIONS

1 Figure or Table

Topics

Statistics

02040'82'85'89'93'97'01'05'09'13'17
Citations per Year

430 Citations

Semantic Scholar estimates that this publication has 430 citations based on the available data.

See our FAQ for additional information.