Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar3. CoCo 1988: Georgetown University, Washington, D. C., USA
Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988. IEEE Computer Society 1988, ISBN 0-8186-0794-7- Leonard Pitt, Manfred K. Warmuth:
Reductions among prediction problems: on the difficulty of predicting automata. 60-69 - Ming Li, Paul M. B. Vitányi:
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. 80-101 - Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, Martin Tompa:
Two applications of complementation via inductive counting. 116-125 - Lance Fortnow, John Rompel, Michael Sipser:
On the power of multi-power interactive protocols. 156-161 - Samuel R. Buss, Louise Hay:
On truth-table reducibility to SAT and the difference hierarchy over NP. 224-233 - Ronald V. Book, Ding-Zhu Du, David A. Russo:
On polynomial and generalized complexity cores. 236-250 - Juichi Shinoda, Theodore A. Slaman:
On the theory of the PTIME degrees of the recursive sets. 252-257
maintained by 
at 
at 
last updated on 2018-07-15 22:01 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint