1199 search results - page 114 / 240 » Parameterized Proof Complexity |
86
Voted
CORR
2002
Springer
15 years 15 days ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
137
Voted
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
122
Voted
JFP
2007
15 years 18 days ago
2007
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
200
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
114
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...