165 search results - page 18 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
85
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
98
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
WIA
2005
Springer
15 years 5 months ago
2005
Springer
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
DNA
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
STOC
2005
ACM
15 years 12 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...