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

From Wikidata
Jump to navigation Jump to search
No description defined
edit
Language Label Description Also known as
English
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
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