4744 search results - page 234 / 949 » Connected Computing |
136
Voted
JSC
2010
15 years 2 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
101
Voted
OWLED
2008
15 years 5 months ago
2008
OWL ontologies are complex computational artifacts that are intimately connected with conceptual information and with application issues that are not easily explicable in the conte...
130
Voted
MOC
2002
15 years 3 months ago
2002
For a linear ordinary differential equation the Lie algebra of its infinitesimal Lie symmetries is compared with its differential Galois group. For this purpose an algebraic formul...
104
Voted
COCO
2004
Springer
15 years 9 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
123
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...