Search Results

Filter
  • 1-10 of  17,180 results for ""COMPUTATIONAL complexity""
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Periodical

How Easy Is It to Describe Hard Polynomials?: Technical Perspective.

Subjects: POLYNOMIALS; COMPUTATIONAL complexity; ALGEBRA

  • Source: Communications of the ACM. Feb2024, Vol. 67 Issue 2, p100-100. 1p.

Record details

×
Periodical

THE PROBLEM TO END ALL PROBLEMS.

Subjects: COMPUTATIONAL complexity; POLYNOMIAL vs. nondeterministic polynomial problem; COMPLETENESS theorem

  • Source: MIT Technology Review. Nov/Dec2021, Vol. 124 Issue 6, p56-63. 8p. 3 Color Photographs.

Record details

×
  • 1-10 of  17,180 results for ""COMPUTATIONAL complexity""