๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial time uniformization and non-standard methods

โœ Scribed by J. P. Ressayre

Publisher
Springer Netherlands
Year
1996
Tongue
English
Weight
534 KB
Volume
16
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial generation and quasi-interpol
Polynomial generation and quasi-interpolation in stationary non-uniform subdivision
โœ A. Levin ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

We study the necessary and sufficient conditions for the generation of polynomials by stationary subdivision schemes, and we show how to derive appropriate quasi-interpolation rules that have the optimal approximation order. We show that these conditions hold in the context of non-uniform subdivisio

Chained time trade-off and standard gamb
Chained time trade-off and standard gamble methods
โœ Paul McNamee; Sharon Glendinning; Jonathan Shenfine; Nick Steen; S.Michael Griff ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer ๐ŸŒ French โš– 218 KB
Non-associative Lambek Categorial Gramma
Non-associative Lambek Categorial Grammar in Polynomial Time
โœ Erik Aarts; Kees Trautwein ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 455 KB

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial