#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2003

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paulin Jacobé de Naurois
- CiE
- 2006

We propose a new complexity measure of space for the BSS model of computation. We define LOGSPACEW and PSPACEW complexity classes over the reals. We prove that LOGSPACEW is included in NC 2 R ∩ PW ,… (More)

- Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois
- computational complexity
- 2005

We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real constants are allowed… (More)

- Paulin Jacobé de Naurois, Virgile Mogbil
- 2008 23rd Annual IEEE Symposium on Logic in…
- 2008

The authors revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NL-complete.

- Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
- J. Log. Comput.
- 2005

We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of… (More)

We provide a new correctness criterion for unit-free MLL proof structures and MELL proof structures with units. We prove that deciding the correctness of a MLL and of a MELL proof structure is… (More)

- Paulin Jacobé de Naurois, Virgile Mogbil
- Theor. Comput. Sci.
- 2011

We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a linear logic proof… (More)

- Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
- Electr. Notes Theor. Comput. Sci.
- 2003

Considering the Blum, Shub, and Smale computational model for real numbers, extended by Poizat to general structures, classical complexity can be considered as the restriction to finite structures of… (More)

- Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
- Inf. Comput.
- 2006

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… (More)

- Felipe Cucker, Paulin Jacobé de Naurois
- computational complexity
- 2009

We characterize the amount of alternation between blocks of Boolean quantifiers (having both existential and universal), blocks of real existential quantifiers, and blocks of real universal… (More)

- Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
- IFIP TCS
- 2004

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… (More)