Sciweavers

9842 search results - page 65 / 1969
» Problem complexity
Sort
View
JSYML
2010
95views more  JSYML 2010»
13 years 4 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
STACS
2005
Springer
14 years 3 months ago
Dynamic Complexity Theory Revisited
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...
Volker Weber, Thomas Schwentick
RSA
2006
104views more  RSA 2006»
13 years 9 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
CCDS
2010
122views more  CCDS 2010»
13 years 7 months ago
The problem of mutually unbiased bases in dimension 6
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
Philippe Jaming, Máté Matolcsi, P&ea...
COMPGEOM
2004
ACM
14 years 3 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount