Sciweavers

747 search results - page 98 / 150
» Consequence Relations In DRT
Sort
View
ECAI
2004
Springer
14 years 1 months ago
Towards a Logical Analysis of Biochemical Reactions
We provide a logical model of biochemical reactions and show how hypothesis generation using weakest sufficient and strongest necessary conditions may be used to provide addition...
Patrick Doherty, Steve Kertes, Martin Magnusson, A...
FSTTCS
2004
Springer
14 years 1 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 1 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
IWPEC
2004
Springer
14 years 1 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
MFCS
2004
Springer
14 years 1 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...