Sciweavers

3228 search results - page 223 / 646
» Computationally Sound Proofs
Sort
View
RTA
2010
Springer
15 years 10 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
RTA
2005
Springer
16 years 2 days ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
FOCS
1995
IEEE
15 years 10 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
DIGRA
2005
Springer
16 years 4 days ago
How Are Games Educational? Learning Theories Embodied in Games
Through the combined efforts of many dedicated researchers across the globe, the “message” of the value of games for learning is starting to be heard in formal education, but ...
Katrin Becker
PERVASIVE
2005
Springer
16 years 3 days ago
Audio Location: Accurate Low-Cost Location Sensing
Audio location is a technique for performing accurate 3D location sensing using off-the-shelf audio hardware. The use of off-the-shelf hardware allows audio location deployment to ...
James Scott, Boris Dragovic