4103 search results - page 129 / 821 » Some results on the Collatz problem |
146
click to vote
PVLDB
2008
15 years 6 months ago
2008
Online-Analytical Processing (OLAP) has been a field of competing technologies for the past ten years. One of the still unsolved challenges of OLAP is how to provide quick respons...
176
click to vote
ECCC
2011
15 years 1 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
142
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Considerable research effort has been spent in trying to formulate a good definition of GA-Hardness. Given an instance of a problem, the objective is to estimate the performance of...
183
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
In this paper some of the most fundamental problems in computational biology are proved intractable. The following problems are shown NP-hard for all binary or larger alphabets und...
156
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...