1101 search results - page 90 / 221 » Forcing in proof theory |
131
click to vote
STOC
1989
ACM
15 years 4 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
AUTOMATICA
2007
15 years 22 days ago
2007
We discuss notions of detectability for stochastic linear control systems of Itˆo type. A natural concept of detectability requires a non-zero output, if the state process is uns...
83
Voted
EJC
2007
15 years 17 days ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
87
Voted
CSL
2002
Springer
15 years 13 days ago
2002
Springer
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
103
Voted
WMCSA
2009
IEEE
15 years 7 months ago
2009
IEEE
There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to ei...