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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540164869, 9783540398257

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 3

Author(s):

James F. Lynch

Keyword(s):

Boolean Circuits

Download Full-text

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 ◽

Cited By ~ 30

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 ◽

Cited By ~ 6

Author(s):

David A. Russo

Keyword(s):

Complete Sets

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 ◽

Cited By ~ 8

Author(s):

Ian Parberry ◽

Georg Schnitger

Keyword(s):

Parallel Computation ◽

Threshold Functions

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

Relativized alternation

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_90 ◽

1986 ◽

pp. 66-76 ◽

Cited By ~ 7

Author(s):

Jonathan F. Buss

Download Full-text

Probabilistic quantifiers, adversaries, and complexity classes : An overview

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_112 ◽

1986 ◽

pp. 383-400 ◽

Cited By ~ 20

Author(s):

Stathis Zachos

Keyword(s):

Complexity Classes

Download Full-text

The topology of provability in complexity theory

Structure in Complexity Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-16486-3_106 ◽

1986 ◽

pp. 291-310

Author(s):

Kenneth W. Regan

Keyword(s):

Complexity Theory

Download Full-text

Structure in Complexity Theory - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

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

A note on one-way functions and polynomial time isomorphisms

Randomness, relativizations, and polynomial reducibilities

Bounded oracles and complexity classes inside linear space

Optimal approximations of complete sets

Parallel computation with threshold functions

The complexity of optimization problems

Relativized alternation

Probabilistic quantifiers, adversaries, and complexity classes : An overview

The topology of provability in complexity theory

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