1818 search results - page 57 / 364 » Granularity-Adaptive Proof Presentation |
135
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
150
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
113
Voted
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
128
Voted
APLAS
2009
ACM
15 years 7 months ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
128
Voted
FMCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper describes a core component of Mobius' Trusted Code Base, the Mobius base logic. This program logic facilitates the transmission of certificates that are generated u...