UNIVERSAL FUNCTIONS WITH SMALL DERIVATIVES AND EXTREMELY FAST GROWTH

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Small fast universal Turing machines

We present a number of time-efficient small universal Turing machines. We show that there exists deterministic polynomial time universal Turing machines with state-symbol products of (3, 11), (5, 7), (6, 6), (7, 5) and (8, 4). These machines are the smallest known universal Turing machines that simulate TMs in polynomial time.

متن کامل

On Universal Classes of Extremely Random Constant-Time Hash Functions

A family of functions F that map 0;n] 7 ! 0;n], is said to be h-wise independent if any h points in 0;n] have an image, for randomly selected f 2 F, that is uniformly distributed. This paper gives both probabilistic and explicit randomized constructions of n-wise independent functions, < 1, that can be evaluated in constant time for the standard random access model of computation. Simple extens...

متن کامل

A small fast universal Turing machine

We present a small time-efficient universal Turing machine with 5 states and 6 symbols. This Turing machine simulates our new variant of tag system. It is the smallest known universal Turing machine that simulates Turing machine computations in polynomial time.

متن کامل

Fast Boolean Matching for Small Practical Functions

This paper proposes a fast algorithm for Boolean matching of completely specified Boolean functions. The algorithm can be applied on-the-fly to millions of small practical functions appearing in industrial designs, leading to runtime and memory reduction in logic synthesis and technology mapping. The algorithm is conceptually simpler, faster, and more scalable than previous work.

متن کامل

Universal Samplers with Fast Verification

Recently, Hofheinz, Jager, Khurana, Sahai, Waters and Zhandry [9] proposed a new primitive called universal samplers that allows oblivious sampling from arbitrary distributions, and showed how to construct universal samplers using indistinguishability obfuscation (iO) in the ROM. One important limitation for applying universal samplers in practice is that the constructions are built upon indist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analysis

سال: 2002

ISSN: 2196-6753,0174-4747

DOI: 10.1524/anly.2002.22.1.57