Hostname: page-component-65f69f4695-q7d28 Total loading time: 0 Render date: 2025-06-30T04:34:03.959Z Has data issue: false hasContentIssue false
  • English
  • Français

Provable conditions in computational complexity theory

Published online by Cambridge University Press:  17 April 2009

Daryel Sachse-Åkerlind
Daryel Sachse-Åkerlind
Affiliation:
Department of Computer Science, University of Indiana, Lindley Hall, 101 Bloomington, Indiana 47405, USA.
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Abstracts of Australasian PhD theses
Information
Bulletin of the Australian Mathematical Society , Volume 31 , Issue 1 , February 1985 , pp. 155 - 156
Copyright
Copyright © Australian Mathematical Society 1985