[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput Soc. Press

0818622555

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Counting classes are at least as hard as the polynomial-time hierarchy

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160238 ◽

2002 ◽

Cited By ~ 9

Author(s):

S. Toda ◽

M. Ogiwara

Keyword(s):

Polynomial Time ◽

Counting Classes ◽

Polynomial Time Hierarchy

Download Full-text

On the Monte Carlo Boolean decision tree complexity of read-once formulae

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160259 ◽

2002 ◽

Cited By ~ 12

Author(s):

M. Santha

Keyword(s):

Monte Carlo ◽

Decision Tree ◽

Decision Tree Complexity

Download Full-text

Lower bounds with smaller domain size on concurrent write parallel machines

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160276 ◽

2002 ◽

Cited By ~ 7

Author(s):

J. Edmonds

Keyword(s):

Lower Bounds ◽

Parallel Machines ◽

Domain Size

Download Full-text

Complexity classes and sparse oracles

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160248 ◽

2002 ◽

Cited By ~ 13

Author(s):

D.P. Bovet ◽

P. Crescenzi ◽

R. Silvestri

Keyword(s):

Complexity Classes

Download Full-text

Gap-definable counting classes

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160241 ◽

2002 ◽

Cited By ~ 29

Author(s):

S.A. Fenner ◽

L.J. Fortnow ◽

S.A. Kurtz

Keyword(s):

Counting Classes

Download Full-text

The power of witness reduction

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160242 ◽

2002 ◽

Cited By ~ 7

Author(s):

S. Gupta

Download Full-text

Approximation properties of NP minimization classes

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160280 ◽

2002 ◽

Cited By ~ 20

Author(s):

P.G. Kolaitis ◽

M.N. Thakur

Keyword(s):

Approximation Properties

Download Full-text

Degree complexity of Boolean functions and its applications to relativized separations

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160282 ◽

2002 ◽

Cited By ~ 12

Author(s):

J. Tarui

Keyword(s):

Boolean Functions ◽

Degree Complexity

Download Full-text

Bounded queries in recursion theory: a survey

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160245 ◽

2002 ◽

Cited By ~ 11

Author(s):

W. Gasarch

Keyword(s):

Recursion Theory ◽

Bounded Queries

Download Full-text

The perceptron strikes back

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1991.160270 ◽

2002 ◽

Cited By ~ 23

Author(s):

R. Beigel ◽

N. Reingold ◽

D. Spielman

Download Full-text

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory ConferenceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput Soc. Press

Counting classes are at least as hard as the polynomial-time hierarchy

On the Monte Carlo Boolean decision tree complexity of read-once formulae

Lower bounds with smaller domain size on concurrent write parallel machines

Complexity classes and sparse oracles

Gap-definable counting classes

The power of witness reduction

Approximation properties of NP minimization classes

Degree complexity of Boolean functions and its applications to relativized separations

Bounded queries in recursion theory: a survey

The perceptron strikes back

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Latest Publications