Resource bounded symmetry of information revisited
Theoretical Computer Science - Mathematical foundations of computer science 2004
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Language compression and pseudorandom generators
Computational Complexity
Nondeterministic Instance Complexity and Proof Systems with Advice
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Variations on Muchnik's Conditional Complexity Theorem
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Nearly bounded error probabilistic sets
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Slightly beyond Turing's computability for studying genetic programming
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Generation complexity versus distinction complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Avoiding simplicity is complex
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Proof systems that take advice
Information and Computation
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
On the optimal compression of sets in PSPACE
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Multisource algorithmic information theory
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We take a fresh look at CD complexity, where CDt(x) is the size of the smallest program that distinguishes x from all other strings in time t(|x|). We also look at CND complexity, a new nondeterministic variant of CD complexity, and time-bounded Kolmogorov complexity, denoted by C complexity.We show several results relating time-bounded C, CD, and CND complexity and their applications to a variety of questions in computational complexity theory, including the following: Showing how to approximate the size of a set using CD complexity without using the random string as needed in Sipser's earlier proof of a similar result. Also, we give a new simpler proof of this result of Sipser's. Improving these bounds for almost all strings, using extractors. A proof of the Valiant--Vazirani lemma directly from Sipser's earlier CD lemma. A relativized lower bound for CND complexity. Exact characterizations of equivalences between C, CD, and CND complexity. Showing that satisfying assignments of a satisfiable Boolean formula can be enumerated in time polynomial in the size of the output if and only if a unique assignment can be found quickly. This answers an open question of Papadimitriou. A new Kolmogorov complexity-based proof that BPP\subseteq\Sigma_2^p$. New Kolmogorov complexity based constructions of the following relativized worlds: There exists an infinite set in P with no sparse infinite NP subsets. EXP=NEXP but there exists a NEXP machine whose accepting paths cannot be found in exponential time. Satisfying assignments cannot be found with nonadaptive queries to SAT.