Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
Latest Publications

TOTAL DOCUMENTS

38

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818656700

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Unambiguous polynomial hierarchies and exponential size

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315812 ◽

2002 ◽

Author(s):

K.-J. Lange ◽

P. Rossmanith

Keyword(s):

Exponential Size

Download Full-text

On the isomorphism problem for weak reducibilities

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315790 ◽

2002 ◽

Author(s):

M. Agrawal

Keyword(s):

Isomorphism Problem

Download Full-text

Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315818 ◽

2002 ◽

Author(s):

S.E. Mocas

Keyword(s):

Exponential Time

Download Full-text

Collapsing degrees in subexponential time

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315788 ◽

2002 ◽

Author(s):

D. Joseph ◽

R. Pruim ◽

P. Young

Keyword(s):

Subexponential Time

Download Full-text

Downward separation fails catastrophically for limited nondeterminism classes

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315810 ◽

2002 ◽

Author(s):

R. Beigel ◽

J. Goldsmith

Keyword(s):

Limited Nondeterminism

Download Full-text

Constructive separation of classes of indistinguishable ensembles

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315804 ◽

2002 ◽

Author(s):

B. Meyer

Download Full-text

Polynomial time truth-table reductions to p-selective sets

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315821 ◽

2002 ◽

Author(s):

M. Agrawal ◽

V. Arvind

Keyword(s):

Polynomial Time ◽

Download Full-text

Space lower-bounds for pseudorandom-generators

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315805 ◽

2002 ◽

Author(s):

Xiangdong Yu ◽

Moti Yung

Keyword(s):

Lower Bounds ◽

Pseudorandom Generators

Download Full-text

On the query complexity of clique size and maximum satisfiability

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315820 ◽

2002 ◽

Author(s):

R. Chang

Keyword(s):

Query Complexity ◽

Maximum Satisfiability

Download Full-text

Alternation in interaction

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory ◽

10.1109/sct.1994.315795 ◽

2002 ◽

Author(s):

M. Kiwi ◽

C. Lund ◽

A. Russell ◽

D. Spielman ◽

R. Sundaram

Download Full-text