Sciweavers

251 search results - page 1 / 51
» Finite Model Reasoning in Description Logics
Sort
View
CSL
2010
Springer
13 years 5 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
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 ...
Kord Eickmeyer, Martin Grohe