Sciweavers

6045 search results - page 57 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ECCC
2000
75views more  ECCC 2000»
13 years 7 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib
IPPS
2007
IEEE
14 years 2 months ago
RNAVLab: A unified environment for computational RNA structure analysis based on grid computing technology
Ribonucleic acid (RNA) molecules play important roles in many biological processes including gene expression and regulation. An RNA molecule is a linear polymer which folds back o...
Michela Taufer, Ming-Ying Leung, Kyle L. Johnson, ...
CCA
2009
Springer
14 years 2 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
FSTTCS
2009
Springer
14 years 2 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard