Calculs sur les structures de langage dénombrable

Authors:
Ménard Bourgade
Affiliations:
Univ. Claude Bernard Lyon I, Villeurbanne Cedex, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 7
Cited 0

Structural complexity 1

Structural complexity 1
Relativizations of the P=?NP question over the reals (and other ordered rings)

Selected papers of the workshop on Continuous algorithms and complexity
P ≠ NP over the nonstandard reals implies P ≠ NP over R

Selected papers of the workshop on Continuous algorithms and complexity
Accessible telephone directories

Journal of Symbolic Logic
Computational complexity over the p-adic numbers

Journal of Complexity
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem

Journal of the ACM (JACM)
Machines and complexity over thep-adic numbers

Machines and complexity over thep-adic numbers

Quantified Score

Hi-index	5.23

Visualization

Abstract

We develop two models of calculus over stuctures of countable signature and the main items of the "structural complexity theory" which relates to them. In particular, we prove the existence of universal machines, complete problems, and structures with the P=NP property. In this frame, we are starting the study of Z-group without order and the field of p-adic numbers Qp.