Structure in Complexity Theory - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

28

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540164869, 9783540398257

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A note on one-way functions and polynomial time isomorphisms

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_98 ◽

1986 ◽

pp. 196-196

Author(s):

Ker-I Ko ◽

Timothy J. Long ◽

Ding-Zhu Du

Keyword(s):

Polynomial Time

Download Full-text

Randomness, relativizations, and polynomial reducibilities

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_87 ◽

1986 ◽

pp. 23-34 ◽

Author(s):

Klaus Ambos-Spies

Download Full-text

Bounded oracles and complexity classes inside linear space

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_110 ◽

1986 ◽

pp. 347-361

Author(s):

Carol Tretkoff

Keyword(s):

Linear Space ◽

Complexity Classes

Download Full-text

Optimal approximations of complete sets

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_107 ◽

1986 ◽

pp. 311-324 ◽

Author(s):

David A. Russo

Keyword(s):

Download Full-text

Parallel computation with threshold functions

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_105 ◽

1986 ◽

pp. 272-290 ◽

Author(s):

Ian Parberry ◽

Georg Schnitger

Keyword(s):

Parallel Computation ◽

Threshold Functions

Download Full-text

A depth-size tradeoff for boolean circuits with unbounded fan-in

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_102 ◽

1986 ◽

pp. 234-248 ◽

Author(s):

James F. Lynch

Keyword(s):

Boolean Circuits

Download Full-text

The complexity of optimization problems

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_100 ◽

1986 ◽

pp. 218-218

Author(s):

Mark W. Krentel

Keyword(s):

Optimization Problems

Download Full-text

An optimal lower bound for turing machines with one work tape and a two-way input tape

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_103 ◽

1986 ◽

pp. 249-264 ◽

Author(s):

Wolfgang Maass ◽

Georg Schnitger

Keyword(s):

Lower Bound ◽

Turing Machines ◽

Optimal Lower Bound

Download Full-text

Resource-bounded Kolmogorov complexity of hard languages

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_97 ◽

1986 ◽

pp. 184-195 ◽

Author(s):

Dung T. Huynh

Keyword(s):

Kolmogorov Complexity

Download Full-text

Parallel computation and the NC hierarchy relativized

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_111 ◽

1986 ◽

pp. 362-382 ◽

Author(s):

Christopher B. Wilson

Keyword(s):

Parallel Computation

Download Full-text