Sciweavers

1199 search results - page 168 / 240
» Parameterized Proof Complexity
Sort
View
VSTTE
2005
Springer
14 years 2 months ago
It Is Time to Mechanize Programming Language Metatheory
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
IJCAI
2003
13 years 10 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
AML
2008
124views more  AML 2008»
13 years 9 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 3 months ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
TIT
2010
128views Education» more  TIT 2010»
13 years 3 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh