1092 search results - page 80 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
185
click to vote
CORR
2010
Springer
15 years 25 days ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
158
click to vote
CP
2007
Springer
16 years 4 days ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
173
click to vote
CISC
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
163
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
161
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...