Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine ..."

Domenico Cantone et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2023-03-10

- view
  - electronic edition @ ceur-ws.org (open access)
- export record
  dblp key:
  - conf/cilc/CantoneCFO19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cilc/CantoneCFO19
Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio G. Omodeo:
Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? CILC 2019: 104-122

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.