Sciweavers

1688 search results - page 5 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
EJC
2008
13 years 7 months ago
Enumeration of almost polynomial rational functions with given critical values
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
Dmitri Panov, Dimitri Zvonkine
IJCAI
2001
13 years 9 months ago
IBAL: A Probabilistic Rational Programming Language
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
Avi Pfeffer
LICS
2012
IEEE
11 years 10 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 6 months ago
Factorization of Polynomials and GCD Computations for Finding Universal Denominators
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov