NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 1 of 1 (0.134 seconds)

Spelling suggestions: "subject:"computational complexity. polynomials."" "subject:"computational complexity. olynomials.""

1

Average-case complexity theory and polynomial-time reductions

Pavan, A. January 2001 (has links)
Thesis (Ph. D.)--State University of New York at Buffalo, 2001. / "August 2001." Includes bibliographical references (p. 80-87). Also available in print.
Computational complexity. Polynomials.

Page generated in 0.1366 seconds