8824 search results - page 266 / 1765 » On the Complexity of Real Functions |
156
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
175
click to vote
EJC
2008
15 years 6 months ago
2008
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...
198
Voted
IJBRA
2008
15 years 6 months ago
2008
: Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [2...
171
click to vote
INFORMATICALT
2006
15 years 6 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
177
click to vote
ASIACRYPT
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to ...