4850 search results - page 203 / 970 » Proof and Computation in Geometry |
171
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
144
click to vote
LICS
2008
IEEE
16 years 28 days ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
193
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
The abuse of online games by automated programs, known as game bots, for gaining unfair advantages has plagued millions of participating players with escalating severity in recent...
172
click to vote
MKM
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
165
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...