1379 search results - page 187 / 276 » The Complexity of the Annihilating Polynomial |
174
click to vote
CAL
2002
15 years 6 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
156
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
169
click to vote
JC
2000
15 years 6 months ago
2000
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...
177
click to vote
PC
2000
15 years 6 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
145
click to vote
DM
1998
15 years 6 months ago
1998
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...