Sciweavers

1139 search results - page 145 / 228
» Bounded Ideation Theory
Sort
View
DAM
2007
67views more  DAM 2007»
13 years 7 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh
JSYML
2008
108views more  JSYML 2008»
13 years 7 months ago
Randomness, lowness and degrees
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
George Barmpalias, Andrew E. M. Lewis, Mariya Ivan...
LATA
2010
Springer
14 years 5 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
State Estimation With Initial State Uncertainty
Abstract--The problem of state estimation with initial state uncertainty is approached from a statistical decision theory point of view. The initial state is regarded as determinis...
Yoav Levinbook, Tan F. Wong
JUCS
2007
71views more  JUCS 2007»
13 years 7 months ago
Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...
Laurentiu Leustean