Expansions of pseudofinite structures and circuit and proof complexity
Logic
2017-02-10 v1 Computational Complexity
Abstract
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a suitable expansion would imply that, assuming a one-way permutation exists, the computational class NP is not closed under complementation.
Cite
@article{arxiv.1505.00118,
title = {Expansions of pseudofinite structures and circuit and proof complexity},
author = {Jan Krajicek},
journal= {arXiv preprint arXiv:1505.00118},
year = {2017}
}
Comments
Preliminary version May 2015