[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818640707

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the power of polynomial time bit-reductions

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336526 ◽

2002 ◽

Cited By ~ 37

Author(s):

U. Hertrampf ◽

C. Lautemann ◽

T. Schwentick ◽

H. Vollmer ◽

K.W. Wagner

Keyword(s):

Polynomial Time

Download Full-text

On span programs

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336536 ◽

2002 ◽

Cited By ~ 132

Author(s):

M. Karchmer ◽

A. Wigderson

Keyword(s):

Span Programs

Download Full-text

Pointers versus arithmetic in PRAMs

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336522 ◽

2002 ◽

Author(s):

P.W. Dymond ◽

F.E. Fich ◽

N. Nishimura ◽

P. Ragde ◽

W.L. Ruzzo

Download Full-text

Isomorphisms of NP complete problems on random instances

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336540 ◽

2002 ◽

Cited By ~ 4

Author(s):

J. Belanger ◽

J. Wang

Keyword(s):

Complete Problems ◽

Random Instances ◽

Np Complete

Download Full-text

The complexity of selecting maximal solutions

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336516 ◽

2002 ◽

Cited By ~ 6

Author(s):

Z.-Z. Chen ◽

S. Toda

Keyword(s):

Maximal Solutions

Download Full-text

Computing functions with parallel queries to NP

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336519 ◽

2002 ◽

Cited By ~ 6

Author(s):

B. Jenner ◽

J. Toran

Keyword(s):

Parallel Queries

Download Full-text

On closure properties of Hash P in the context of PF (omicron) Hash P

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336532 ◽

2002 ◽

Author(s):

M. Ogiwara ◽

T. Thierauf ◽

S. Toda ◽

O. Watanabe

Keyword(s):

Closure Properties

Download Full-text

The quantitative structure of exponential time

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336530 ◽

2002 ◽

Cited By ~ 12

Author(s):

J.H. Lutz

Keyword(s):

Quantitative Structure ◽

Exponential Time

Download Full-text

P-selective sets, and reducing search to decision vs. self-reducibility

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336541 ◽

2002 ◽

Cited By ~ 5

Author(s):

A.V. Naik ◽

M. Ogiwara ◽

A.L. Selman

Download Full-text

Towards uncheatable benchmarks

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference ◽

10.1109/sct.1993.336546 ◽

2002 ◽

Cited By ~ 14

Author(s):

J.-y. Cai ◽

R.J. Lipton ◽

R. Sedgewick ◽

A.C.-C. Yao

Download Full-text

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory ConferenceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

On the power of polynomial time bit-reductions

On span programs

Pointers versus arithmetic in PRAMs

Isomorphisms of NP complete problems on random instances

The complexity of selecting maximal solutions

Computing functions with parallel queries to NP

On closure properties of Hash P in the context of PF (omicron) Hash P

The quantitative structure of exponential time

P-selective sets, and reducing search to decision vs. self-reducibility

Towards uncheatable benchmarks

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
Latest Publications