Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures

Olivier Bournez 1 Felipe Cucker Paulin Jacobé de Naurois 1, 2 Jean-Yves Marion 2
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L.Blum, M.Shub and S.Smale. We show that the levels of the polynomial hierarchy correspond to safe recursion with predicative minimization. The levels of the digital polynomial hierarchy correspond to safe recursion with digital predicative minimization. Also, we show that polynomial alternating time corresponds to safe recursion with predicative substitutions and that digital polynomial alternating time corresponds to safe recursion with digital predicative substitutions.
Keywords : bss model implicit complexity complexity
Type de document :
Communication dans un congrès
In 2nd APPSEM II Workshop - APPSEM'04, Apr 2004, Tallinn/Estonia, 2004
Liste complète des métadonnées
https://hal.inria.fr/inria-00000520
Contributeur : Olivier Bournez <>
Soumis le : mercredi 26 octobre 2005 - 19:09:51
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57

Identifiants

  • HAL Id : inria-00000520, version 1

Collections

INRIA | LORIA | UNIV-LORRAINE

Citation

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. In 2nd APPSEM II Workshop - APPSEM'04, Apr 2004, Tallinn/Estonia, 2004. 〈inria-00000520〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

154

Contact


archive-ouverte@inria.fr