8825 search results - page 221 / 1765 » All for one or one for all |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
100
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
95
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...