Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SCT 1987: Ithaca, New York, USA
- Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987. IEEE Computer Society 1987, ISBN 978-0-8186-0794-3
- Uwe Schöning:
Probabilistic complexity classes and lowness. SCT 1987: 2-8 - Martín Abadi, Joan Feigenbaum, Joe Kilian:
On hiding information from an oracle. SCT 1987: 9 - Sophocles Ephremidis, Christos H. Papadimitriou, Martha Sideri:
Complexity characterizations of attribute grammar languages. SCT 1987: 10-13 - Jianer Chen, Chee-Keng Yap:
Reversal complexity. SCT 1987: 14-19 - Amihood Amir, William I. Gasarch:
Polynomial terse sets. SCT 1987: 22-27 - Richard Beigel:
A structural theorem that depends quantitatively on the complexity of SAT. SCT 1987: 28-32 - Jim Kadin:
PNP[log n] and sparse turing complete sets for NP. SCT 1987: 33-40 - Georg Schnitger, Bala Kalyanasundaram:
The probabilistic communication complexity of set intersection. SCT 1987: 41-47 - Judy Goldsmith, Deborah Joseph, Paul Young:
Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT 1987: 50-59 - Klaus Ambos-Spies:
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. SCT 1987: 60-68 - Kenneth W. Regan:
Unprovably intractable languages. SCT 1987: 69-80 - Jack H. Lutz:
Resource bounded baire category and small circuits in exponential space. SCT 1987: 81-91 - Jin-Yi Cai, Merrick L. Furst:
PSPACE survives three-bit bottlenecks. SCT 1987: 94-102 - Lane A. Hemachandra:
On ranking. SCT 1987: 103-117 - John H. Reif:
On threshold circuits and polynomial computation. SCT 1987: 118-123 - Juris Hartmanis, Lane A. Hemachandra:
One-way functions, robustness, and the non-isomorphism of NP-complete sets. SCT 1987: 160-174 - Moon-Jung Chung, Bala Ravikumar:
Strong nondeterministic reduction - a technique for proving intractability. SCT 1987: 132-137 - Osamu Watanabe:
Polynomial time reducibility to a set of small density. SCT 1987: 138-146 - Ronald V. Book, Ker-I Ko:
On sets reducible to sparse sets. SCT 1987: 147-154 - Lance Fortnow:
The complexity of perfect zero-knowledge. SCT 1987: 156 - Eric Allender:
Some consequences of the existence of pseudorandom generators. SCT 1987: 157 - Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Progress on collapsing degrees. SCT 1987: 126-131 - Jonathan F. Buss:
A theory of oracle machines. SCT 1987: 175-181 - Ker-I Ko:
On helping by robust oracle machines. SCT 1987: 182-190 - Lane A. Hemachandra:
The strong exponential hierarchy collapses. SCT 1987: 191 - Neil Immerman:
Expressibility as a complexity measure: results and directions. SCT 1987: 194-202 - Daniel Leivant:
Characterization of complexity classes in higher-order logic. SCT 1987: 203-217 - Anil Nerode, Jeffrey B. Remmel:
Complexity theoretic algebra I - vector spaces over finite fields. SCT 1987: 218-239
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
