A note on dimensions of polynomial size circuits
Computational Complexity
2008-02-29 v2
Abstract
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every , has th order scaled -strong dimension 0. We also show that has -dimension 1/2, -strong dimension 1. Our results improve previous measure results of Lutz (1992) and dimension results of Hitchcock and Vinodchandran (2004).
Cite
@article{arxiv.cs/0404044,
title = {A note on dimensions of polynomial size circuits},
author = {Xiaoyang Gu},
journal= {arXiv preprint arXiv:cs/0404044},
year = {2008}
}
Comments
11 pages