1092 search results - page 83 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
185
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
146
click to vote
ISSAC
2009
Springer
16 years 16 days ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
153
click to vote
ESA
2007
Springer
16 years 4 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
178
click to vote
MST
2011
15 years 28 days ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
176
click to vote
AAAI
1996
15 years 7 months ago
1996
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...