Papers presented at the Workshop on Feasible Mathematics :
نام عام مواد
[Book]
ساير اطلاعات عنواني
[a Mathematical Sciences Institute workshop, Ithaca, New York, June 1989] ; held at Cornell University
نام نخستين پديدآور
[Samuel R. Buss ... (eds.)].
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Boston ; Berlin [u.a.]
نام ناشر، پخش کننده و غيره
Birkhäuser
تاریخ نشرو بخش و غیره
1990
مشخصات ظاهری
نام خاص و کميت اثر
VIII, 349 S.
فروست
عنوان فروست
Progress in computer science and applied logic, 9.; Progress in computer science and applied logic; Feasible mathematics
یادداشتهای مربوط به مندرجات
متن يادداشت
Parity and the Pigeonhole Principle.- Computing over the Reals (or an Arbitrary Ring) Abstract.- On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results.- Sequential, Machine Independent Characterizations of the Parallel Complexity Classes AlogTIME, ACk NCk and NC.- Characterizations of the Basic Feasible Functionals of Finite Type.- Functional Interpretations of Feasibly Constructive Arithmetic - Abstract.- Polynomial-time Combinatorial Operators are Polynomials.- Isols and Kneser Graphs.- Stockmeyer Induction.- Probabilities of Sentences about Two Linear Orderings.- Bounded Linear Logic: a Modular Approach to Polynomial Time Computability, Extended Abstract.- On Finite Model Theory (Extended Abstract).- Computational Models for Feasible Real Analysis.- Inverting a One-to-One Real Function is Inherently Sequential.- On Bounded ?11 Polynomial Induction.- Subrecursion and Lambda Representation over Free Algebras (Preliminary Summary).- Complexity-Theoretic Algebra: Vector Space Bases.- When is every Recursive Linear Ordering of Type ? Recursively Isomorphic to a Polynomial Time Linear Ordering over the Natural Numbers in Binary Form?.
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Berechnungskomplexität.
موضوع مستند نشده
Mathematik.
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )