8824 search results - page 36 / 1765 » On the Complexity of Real Functions |
103
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
MVA
1998
15 years 4 months ago
1998
123
Voted
APAL
2010
15 years 3 months ago
2010
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
119
Voted
CC
2008
Springer
15 years 3 months ago
2008
Springer
65
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer