155 search results - page 6 / 31 » Bounded Arithmetic and Descriptive Complexity |
101
click to vote
CASC
2009
Springer
14 years 10 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
89
Voted
MEMICS
2010
14 years 4 months ago
2010
We describe an automated way to generate data for a practical LLVM instruction selector based on machine-generated description of the target architecture at register transfer leve...
67
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
DAGSTUHL
2004
14 years 11 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
CSL
2010
Springer
14 years 9 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...