18155 search results - page 330 / 3631 » Point |
151
Voted
SODA
1992
ACM
15 years 8 months ago
1992
ACM
213
click to vote
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
206
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
