451 search results - page 39 / 91 » On Parameterized Exponential Time Complexity |
NC
2006
13 years 9 months ago
2006
A monomer structure based on a hairpin loop is described that can be linked via short oligonucleotide sequences (linkers) to form polymers. Independence of linked monomers allow fo...
SYNTHESE
2008
13 years 9 months ago
2008
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
FSTTCS
2004
Springer
14 years 3 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
STACS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...