ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
Latest Publications
TOTAL DOCUMENTS
31
(FIVE YEARS 0)
H-INDEX
8
(FIVE YEARS 0)
Published By IEEE Comput. Soc. Press
0818619589
Latest Documents
Most Cited Documents
Contributed Authors
Related Sources
Related Keywords
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
Download Full-text
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
Download Full-text
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
Download Full-text
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
Download Full-text
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
Download Full-text
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
Download Full-text
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
Download Full-text
The complexity of circuit value and network stability
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
◽
10.1109/sct.1989.41817
◽
2003
◽
Cited By ~ 7
Author(s):
E.W. Mayr
◽
A. Subramanian
Keyword(s):
Network Stability
Download Full-text
On the relativized power of additional accepting paths
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
◽
10.1109/sct.1989.41827
◽
2003
◽
Cited By ~ 10
Author(s):
R. Beigel
Download Full-text
On polynomial time Turing and many-one completeness in PSPACE
[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
◽
10.1109/sct.1989.41810
◽
2003
◽
Cited By ~ 1
Author(s):
O. Watanabe
◽
S. Tang
Keyword(s):
Polynomial Time
Download Full-text
Load More ...
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close