Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

BIRTHDAY
2010
Springer

favoriteEmaildiscussreport

118views Applied Computing» more BIRTHDAY 2010»

Definability of Combinatorial Functions and Their Linear Recurrence Relations

13 years 6 months ago

Definability of Combinatorial Functions and Their Linear Recurrence Relations

Download www.cs.technion.ac.il

Tomer Kotek, Johann A. Makowsky

Real-time Traffic

Applied Computing | BIRTHDAY 2010 |

claim paper

Related Content

» Recurrence relations and fast algorithms

» The Number of OldTime Basketball Games with Final Score n n where the Home Team was Never ...

» Computing Hypergeometric Solutions of Linear Recurrence Equations

» Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency

» On realanalytic recurrence relations for cardinal exponential Bsplines

» Matrix interpretation of multiple orthogonality

» Descending Chains and Antichains of the Unary Linear and Monotone Subfunction Relations

» Convex and Linear Orientations of Polytopal Graphs

» Combinatorial Network Optimization with Unknown Variables MultiArmed Bandits with Linear R...

Post Info
More Details (n/a)

Added	08 Nov 2010
Updated	08 Nov 2010
Type	Conference
Year	2010
Where	BIRTHDAY
Authors	Tomer Kotek, Johann A. Makowsky

Comments (0)