(Q60781615)

English

On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines

No description defined

In more languages
default for all languages
No label defined

No description defined

Statements

On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines (English)
0 references
0 references
0 references
Mike Shub
0 references
1 July 1989
0 references
21
0 references
1
0 references
1-47
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit