Title :
Proceedings of Computational Complexity. Twelfth Annual IEEE Conference
Abstract :
The following topics were dealt with: theorem searching; Shannon entropies and Kolmogorov complexities; dot operator; polynomial time; polynomial vicinity circuits; average case complete; logic programming; NP-jump; weakly complete problems; arithmetic circuits; depth-3 circuit classes; perceptrons; time bounded frequency computations; circuits with non-associative gates; nonadaptive NC permutation checker; transformation monoids; online computation; communication complexity; approximation preserving reductions; max-SAT; constraint satisfaction; bottleneck counting; and monotone computation
Keywords :
combinatorial mathematics; computational complexity; digital arithmetic; information theory; Kolmogorov complexities; NP-jump; Shannon entropy; approximation preserving reductions; arithmetic circuits; average case complete; bottleneck counting; communication complexity; computational complexity; constraint satisfaction; dot operator; logic programming; max-SAT; monotone computation; online computation; perceptrons; polynomial time; time bounded frequency computations; transformation monoids; weakly complete problems;
Conference_Titel :
Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference)
Conference_Location :
Ulm, Germany
Print_ISBN :
0-8186-7907-7
DOI :
10.1109/CCC.1997.612294
