✦ LIBER ✦

Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses

✍ Scribed by Baum, Ulrich; Clausen, Michael

Book ID: 118176847
Publisher: Society for Industrial and Applied Mathematics
Year: 1991
Tongue: English
Weight: 821 KB
Volume: 20
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0220028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for Fourier transforms of e

Upper bounds for Fourier transforms of exponential functions

✍ Knockaert, L. 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 210 KB

Algorithms for Sat and Upper Bounds on T

Algorithms for Sat and Upper Bounds on Their Complexity

✍ M. A. Vsemirnov; E. A. Hirsch; E. Ya. Dantsin; S. V. Ivanov 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 264 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

On lower bounds for the complexity of po

On lower bounds for the complexity of polynomials and their multiples

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB

Lower bounds on time complexity for some

Lower bounds on time complexity for some subgraph detection problems

✍ Masanari Arai; Masafumi Yamashita; Tomio Hirata; Toshihide Ibaraki; Namio Honda 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

Upper and lower bounds for inverse eleme

Upper and lower bounds for inverse elements of finite and infinite tridiagonal matrices

✍ P.N. Shivakumar; Chuanxiang Ji 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 881 KB