We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-4 of 4 results
  1. Computable Procedures for Fields

    This tutorial will introduce listeners to many questions that can be asked about computable processes on fields, and will present the answers that...
    Russell Miller in Connecting with Computability
    Conference paper 2021
  2. Randomization in Robustness, Estimation, and Optimization

    This is an attempt to discuss the following question: When is a random choice better than a deterministic one? That is, if we have an original...
    B. Polyak, P. Shcherbakov in Uncertainty in Complex Networked Systems
    Chapter 2018
  3. Smooth Map**s

    Sard’s Theorem is an important tool in differential topology and in Morse theory. We shall begin our discussion of Sard’s theorem by treating the...
    Steven G. Krantz, Harold R. Parks in The Geometry of Domains in Space
    Chapter 1999
  4. Recognition problems for special classes of polynomials in 0–1 variables

    This paper investigates the complexity of various recognition problems for pseudo-Boolean functions (i.e., real-valued functions defined on the unit...

    Yves Crama in Mathematical Programming
    Article 01 May 1989
Did you find what you were looking for? Share feedback.