8496 search results - page 301 / 1700 » Problem Solving and Complex Systems |
150
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
226
click to vote
IADIS
2003
15 years 8 months ago
2003
Today’s users want to access their data everywhere and any time – in various environments and occasions. The data itself can be very complex – the problem is then in providi...
183
click to vote
ACISP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
173
click to vote
ESEM
2008
ACM
15 years 8 months ago
2008
ACM
Some agile voices have been raised against extensive documentation. They advocate its sparse use and production. In this paper, we report from agile evolution and maintenance tren...
175
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...