Semantic Scholar uses AI to extract papers important to this topic.
We present a new strategy for calibration and validation of hierarchical multiscale models based on computational homogenization… Expand Accurate Computational Fluid Dynamics (CFD) simulations of atmospheric boundary layer (ABL) flow are essential for a wide variety… Expand Abstract.Impagliazzo and Wigderson (1998) gave the first construction of pseudorandom generators from a uniform complexity… Expand The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs). This paper reports some… Expand This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm… Expand The study of self-testing/correcting programs was introduced in  in order to allow one to use program P to compute function f… Expand The paper studies effective approximate solutions to combinatorial counting and uniform generation problems. Using a technique… Expand The notion of a zero knowledge interactive proof that one party "knows" some secret information is explored. It is shown that any… Expand Abstract The class of problems involving the random generation of combinatorial structures from a uniform distribution is… Expand Abstract P-selective sets are used to distinguish polynomial time-bounded reducibilities on NP. In particular, we consider… Expand