840 search results - page 7 / 168 » The Complexity of the Extended GCD Problem |
JC
2007
13 years 7 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
ACL
1993
13 years 9 months ago
1993
This paper describes the problems faced while using Kimmo's two-level model to describe certain Indian languages such as Tamil and Hindi. The two-level model is shown to be d...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
ASE
1998
13 years 7 months ago
1998
Designing a complex software system is a cognitivelychallengingtask; thus, designers need cognitive support to create good designs. Domain-oriented design environments are cooperat...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...