<--- Back to Details
First PageDocument Content
Richard Askey / Katholieke Universiteit Leuven / Polynomial / Academia / Mathematics / Education / Tom H. Koornwinder / Special functions / Orthogonal polynomials
Date: 2008-09-17 08:34:53
Richard Askey
Katholieke Universiteit Leuven
Polynomial
Academia
Mathematics
Education
Tom H. Koornwinder
Special functions
Orthogonal polynomials

Add to Reading List

Source URL: staff.fnwi.uva.nl

Download Document from Source Website

File Size: 203,64 KB

Share Document on Facebook

Similar Documents

Theoretical computer science / Computational complexity theory / Mathematical logic / Constraint programming / Logic in computer science / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / Satisfiability modulo theories / Maximum satisfiability problem / Local consistency

Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain

DocID: 1xVFd - View Document

Algebra / Abstract algebra / Mathematics / Commutative algebra / Lattice-based cryptography / Post-quantum cryptography / Cryptography / Field theory / Ring learning with errors / Ring learning with errors key exchange / Ring learning with errors signature

On the Ring-LWE and Polynomial-LWE Problems Miruna Rosca1,2 , Damien Stehlé1 , and Alexandre Wallet1 1 ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France

DocID: 1xVxG - View Document

Algebra / Polynomial / RASAT / Inequality / NP-complete problems

raSAT: SMT for Polynomial Inequality To Van Khanh (UET/VNU-HN) Vu Xuan Tung, Mizuhito Ogawa (JAIST

DocID: 1xVsE - View Document

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas

DocID: 1xUE0 - View Document

Cryptography / Mathematics / Polynomials / Multivariate cryptography / Algebra / Pseudorandom number generator / Computer algebra / Hidden Field Equations / QUAD / Field extension / Cryptographically secure pseudorandom number generator / Mersenne Twister

Secure PRNGs from Specialized Polynomial Maps over Any Fq Feng-Hao Liu1 , Chi-Jen Lu2 , and Bo-Yin Yang2 1 Department of Computer Science, Brown University, Providence RI, USA

DocID: 1xUwb - View Document