Sciweavers

364 search results - page 18 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
AMAST
2006
Springer
13 years 11 months ago
Some Programming Languages for Logspace and Ptime
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
Guillaume Bonfante
ERSHOV
2009
Springer
14 years 1 months ago
On the Containment Problem for Queries in Conjunctive Form with Negation
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
Victor Felea
MST
1998
76views more  MST 1998»
13 years 7 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
INFORMS
2010
107views more  INFORMS 2010»
13 years 5 months ago
A Class Representative Model for Pure Parsimony Haplotyping
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
Daniele Catanzaro, Alessandra Godi, Martine Labb&e...
SMI
2005
IEEE
14 years 28 days ago
Volumetric Data Analysis using Morse-Smale Complexes
The 3D Morse-Smale complex is a fundamental topological construct that partitions the domain of a real-valued function into regions having uniform gradient flow behavior. In this...
Vijay Natarajan, Valerio Pascucci