2799 search results - page 317 / 560 » computing 1998 |
110
Voted
COCO
1998
Springer
15 years 8 months ago
1998
Springer
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
103
click to vote
SIGCSE
1998
ACM
15 years 8 months ago
1998
ACM
First-year computer science students need to see clearly that computer science as a discipline has an important intellectual role to play and that it offers deep philosophical que...
134
click to vote
FPGA
1998
ACM
15 years 8 months ago
1998
ACM
Current reconfigurable systems suffer from a significant overhead due to the time it takes to reconfigure their hardware. In order to deal with this overhead, and increase the com...
145
Voted
ICSE
1998
IEEE-ACM
15 years 8 months ago
1998
IEEE-ACM
Program slicing, a technique to compute the subset of program statements that can affect the value of a program variable at a specific program point, is widely used in tools to su...
125
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...