NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 1
  • Tagged with
  • 7
  • 7
  • 7
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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 7 of 7 (0.037 seconds)

Spelling suggestions: "subject:"bollständigel deproblem"" "subject:"bollständigel 3dproblem""

1

NP-completeness notions under strong hypotheses

Bentzien, Levke. January 2000 (has links) (PDF)
Heidelberg, University, Diss., 2000.
NP-vollständiges Problem
2

Models and algorithms for school timetabling a constraint programming approach /

Marte, Michael. Unknown Date (has links) (PDF)
University, Diss., 2002--München.
3

Terminologische Sprachen zur Repräsentation und Lösung von ressourcenbeschränkten Ablaufplanungsproblemen mit Prozeßvarianten

Kim, Pok-Son. Unknown Date (has links)
Universiẗat, Diss., 2001--Frankfurt (Main).
4

Learning with recurrent neural networks

Hammer, Barbara. Unknown Date (has links)
University, Diss., 1999--Osnabrück.
5

Average case approximability of optimisation problems

Schelm, Birgit. Unknown Date (has links) (PDF)
Techn. University, Diss., 2004--Berlin.
6

Completeness for parallel access to NP and counting class separations

Spakowski, Holger. Unknown Date (has links)
University, Diss., 2005--Düsseldorf.
7

Efficient checking of polynomials and proofs and the hardness of approximation problems /

Sudan, Madhu. January 1900 (has links)
Based on the author's Ph. D. thesis, University of California, Berkeley, 1993. / Includes bibliographical references (p. [73]-78) and index. Also issued online.

Page generated in 0.0415 seconds