840 search results - page 7 / 168 » The Complexity of the Extended GCD Problem |
136
click to vote
JC
2007
15 years 3 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 ...
119
click to vote
ACL
1993
15 years 5 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...
132
click to vote
COCOA
2007
Springer
15 years 10 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...
133
click to vote
ASE
1998
15 years 3 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...
122
Voted
GECCO
2007
Springer
15 years 10 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...