[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818619589

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the structure of bounded queries to arbitrary NP sets

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41832 ◽

2003 ◽

Cited By ~ 4

Author(s):

R. Chang

Keyword(s):

Bounded Queries

Almost everywhere high nonuniform complexity

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41813 ◽

2003 ◽

Cited By ~ 5

Author(s):

J.H. Lutz

Keyword(s):

Almost Everywhere

Finitary substructure languages with application to the theory of NP-completeness

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41814 ◽

2003 ◽

Cited By ~ 3

Author(s):

K.W. Regan

Keyword(s):

Np Completeness

The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41804 ◽

2003 ◽

Cited By ~ 1

Author(s):

R.A. Shore ◽

T.A. Slaman

Keyword(s):

Quantifier Theory

Results on communication complexity classes

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41821 ◽

2003 ◽

Cited By ~ 2

Author(s):

T.W. Lam ◽

W.L. Ruzzo

Keyword(s):

Communication Complexity ◽

Complexity Classes

Oracles for structural properties: the isomorphism problem and public-key cryptography

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41809 ◽

2003 ◽

Cited By ~ 10

Author(s):

S. Homer ◽

A.L. Selman

Keyword(s):

Structural Properties ◽

Public Key Cryptography ◽

Isomorphism Problem ◽

Public Key

Inductive reasoning and Kolmogorov complexity

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41823 ◽

2003 ◽

Cited By ~ 13

Author(s):

M. Li ◽

P.M.B. Vitanyi

Keyword(s):

Kolmogorov Complexity ◽

Inductive Reasoning

Composition is almost as good as s-1-1

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41805 ◽

2003 ◽

Cited By ~ 6

Author(s):

Y. Marcoux

Multi-oracle interactive protocols with space bounded verifiers

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41822 ◽

2003 ◽

Cited By ~ 7

Author(s):

U. Feige ◽

A. Shamir

The complexity of iterated multiplication

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference ◽

10.1109/sct.1989.41816 ◽

2003 ◽

Cited By ~ 18

Author(s):

N. Immerman ◽

S. Landau

[1989] Proceedings. Structure in Complexity Theory Fourth Annual ConferenceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

On the structure of bounded queries to arbitrary NP sets

Almost everywhere high nonuniform complexity

Finitary substructure languages with application to the theory of NP-completeness

The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory

Results on communication complexity classes

Oracles for structural properties: the isomorphism problem and public-key cryptography

Inductive reasoning and Kolmogorov complexity

Composition is almost as good as s-1-1

Multi-oracle interactive protocols with space bounded verifiers

The complexity of iterated multiplication

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
Latest Publications