Proceedings 15th Annual IEEE Conference on Computational Complexity

The following topics were dealt with: time-space tradeoff lower bounds for non-uniform computation; a lower bound for the shortest path problem; time-space lower bounds for SAT on uniform and non-uniform machines; on the complexity of some problems on groups input as multiplication tables; the complexity of tensor calculus; the complexity of verifying the characteristic polynomial and testing similarity; a dual version of Reimer´s inequality and a proof of Rudich´s conjecture; computational complexity and phase transitions; an application of matroid theory to the SAT problem; easiness assumptions and hardness tests: trading time for zero error; dimension in complexity classes; average case complexity of unbounded fanin circuits; a separation of determinism, Las Vegas and nondeterminism for picture recognition; on the complexity of intersecting finite state automata; quantum Kolmogorov complexity; on the complexity of quantum ACC; three approaches to the quantitative definition of information in an individual pure quantum state; characterization of non-deterministic quantum query and quantum communication complexity