Randomisation and Derandomisation in Descriptive Complexity Theory

DOI10.2168/LMCS-7(3:14)2011zbMath1237.68093OpenAlexW2002952819MaRDI QIDQ5895525

Kord Eickmeyer, Martin Grohe

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-7(3:14)2011

zbMATH Keywords

probabilistic complexity classesdescriptive complexityderandomisation

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Randomisation and Derandomisation in Descriptive Complexity Theory