1805 search results - page 7 / 361 » A Theory of Closure Operators |
100
Voted
ILP
2005
Springer
15 years 3 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
JUCS
2010
14 years 8 months ago
2010
: We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation...
94
Voted
STACS
2009
Springer
15 years 4 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
DLT
2009
14 years 7 months ago
2009
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a gi...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...