Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-17T20:11:47.718Z Has data issue: false hasContentIssue false
  • English
  • Français

Accessible telephone directories

Published online by Cambridge University Press:  12 March 2014

John B. Goode
John B. Goode*
Affiliation:
Université Claude Bernard (Lyon-1), Mathématiques, Bâtiment 101, 69622 Villeurbanne-Cédex, FranceE-mail:, kazak@lanl.univ-lyon1.fr.
Get access Rights & Permissions [Opens in a new window]

Abstract

We reduce to a standard circuit-size complexity problem a relativisation of the P=NP question that we believe to be connected with the same question in the model for computation over the reals defined by L. Blum. M. Shub, and S. Smale. On this occasion, we set the foundations of a general theory for computation over an arbitrary structure, extending what these three authors did in the case of rings.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 59 , Issue 1 , March 1994 , pp. 92 - 105
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[BP 1988]Bouscaren, Elisabeth and Poizat, Bruno, Des belles paires aux beaux uples, this Journal, vol. 53, pp. 434–442.Google Scholar
[BSS 1989]Blum, Lenore, Shub, Mike and Smale, Steve, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines, Bulletin of the American Mathematical Society, vol. 21, pp. 1–46.CrossRefGoogle Scholar
[S 1990]Stern, Jacques, Fondements mathématiques de l'Informatique: logique et complexité, McGraw-Hill, Paris.Google Scholar