Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818670525

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Resource-bounded Baire category: a stronger approach

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514856 ◽

2002 ◽

Cited By ~ 9

Author(s):

S.A. Fenner

Keyword(s):

Baire Category

On the power of number-theoretic operations with respect to counting

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514868 ◽

2002 ◽

Cited By ~ 6

Author(s):

U. Hertrampf ◽

H. Vollmer ◽

K.W. Wagner

On approximation algorithms for hierarchical MAX-SAT

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514860 ◽

2002 ◽

Cited By ~ 1

Author(s):

S. Agarwal ◽

A. Condon

Keyword(s):

Approximation Algorithms ◽

Max Sat

DSPACE(n)=?NSPACE(n): a degree theoretic characterization

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514869 ◽

2002 ◽

Cited By ~ 1

Author(s):

M. Agrawal

Keyword(s):

Theoretic Characterization

Frequency computation and bounded queries

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514852 ◽

2002 ◽

Cited By ~ 4

Author(s):

R. Beigel ◽

W. Gasarch ◽

E. Kinber

Keyword(s):

Bounded Queries

On the structure of low sets [complexity classes]

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514863 ◽

2002 ◽

Cited By ~ 2

Author(s):

J. Kobler

Keyword(s):

Complexity Classes

Counting quantifiers, successor relations, and logarithmic space

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514723 ◽

2002 ◽

Cited By ~ 13

Author(s):

K. Etessami

Keyword(s):

Logarithmic Space

Semi-unbounded fan-in circuits: Boolean vs. arithmetic

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514730 ◽

2002 ◽

Cited By ~ 3

Author(s):

A. Gal

On superlinear lower bounds in complexity theory

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514727 ◽

2002 ◽

Cited By ~ 1

Author(s):

K.W. Regan

Keyword(s):

Complexity Theory ◽

Lower Bounds

Towards average-case complexity analysis of NP optimization problems

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference ◽

10.1109/sct.1995.514854 ◽

2002 ◽

Cited By ~ 8

Author(s):

R. Schuler ◽

O. Watanabe

Keyword(s):

Complexity Analysis ◽

Optimization Problems ◽

Average Case ◽

Case Complexity ◽

Np Optimization ◽

Average Case Complexity

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE ConferenceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

Resource-bounded Baire category: a stronger approach

On the power of number-theoretic operations with respect to counting

On approximation algorithms for hierarchical MAX-SAT

DSPACE(n)=?NSPACE(n): a degree theoretic characterization

Frequency computation and bounded queries

On the structure of low sets [complexity classes]

Counting quantifiers, successor relations, and logarithmic space

Semi-unbounded fan-in circuits: Boolean vs. arithmetic

On superlinear lower bounds in complexity theory

Towards average-case complexity analysis of NP optimization problems

Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
Latest Publications