Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540632481, 9783540692478

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Randomness, stochasticity and approximations

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_18 ◽

1997 ◽

pp. 213-225

Author(s):

Yongge Wang

Download Full-text

Super-bits, demi-bits, and NP/qpoly-natural proofs

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_8 ◽

1997 ◽

pp. 85-93 ◽

Cited By ~ 7

Author(s):

Steven Rudich

Download Full-text

Resource-bounded randomness and compressibility with respect to nonuniform measures

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_17 ◽

1997 ◽

pp. 197-211 ◽

Cited By ~ 2

Author(s):

Steven M. Kautz

Download Full-text

Approximation algorithms for covering polygons with squares and similar problems

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_3 ◽

1997 ◽

pp. 27-41 ◽

Cited By ~ 3

Author(s):

Christos Levcopoulos ◽

Joachim Gudmundsson

Keyword(s):

Approximation Algorithms

Download Full-text

Random-based scheduling new approximations and LP lower bounds

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_11 ◽

1997 ◽

pp. 119-133 ◽

Cited By ~ 27

Author(s):

Andreas S. Schulz ◽

Martin Skutella

Keyword(s):

Lower Bounds

Download Full-text

Probabilistic approximation of some NP optimization problems by finite-state machines

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_13 ◽

1997 ◽

pp. 151-164 ◽

Cited By ~ 1

Author(s):

Dawei Hong ◽

Jean-Camille Birget

Keyword(s):

Optimization Problems ◽

Finite State Machines ◽

State Machines ◽

Np Optimization ◽

Probabilistic Approximation ◽

Finite State

Download Full-text

‘Go with the winners’ generators with applications to molecular modeling

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_12 ◽

1997 ◽

pp. 135-149 ◽

Cited By ~ 1

Author(s):

Marcus Peinado ◽

Thomas Lengauer

Keyword(s):

Molecular Modeling

Download Full-text

Average-case complexity of shortest-paths problems in the vertex-potential model

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_2 ◽

1997 ◽

pp. 15-26 ◽

Cited By ~ 3

Author(s):

Colin Cooper ◽

Alan Frieze ◽

Kurt Mehlhorn ◽

Volker Priebe

Keyword(s):

Potential Model ◽

Shortest Paths ◽

Average Case ◽

Case Complexity ◽

Average Case Complexity

Download Full-text

Random sampling of Euler tours

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_6 ◽

1997 ◽

pp. 57-66

Author(s):

Prasad Tetali ◽

Santosh Vempala

Keyword(s):

Random Sampling ◽

Euler Tours

Download Full-text

A combinatorial consistency lemma with application to proving the PCP theorem

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-63248-4_7 ◽

1997 ◽

pp. 67-84 ◽

Cited By ~ 5

Author(s):

Oded Goldreich ◽

Shmuel Safra

Keyword(s):

Pcp Theorem

Download Full-text

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Randomness, stochasticity and approximations

Super-bits, demi-bits, and NP/qpoly-natural proofs

Resource-bounded randomness and compressibility with respect to nonuniform measures

Approximation algorithms for covering polygons with squares and similar problems

Random-based scheduling new approximations and LP lower bounds

Probabilistic approximation of some NP optimization problems by finite-state machines

‘Go with the winners’ generators with applications to molecular modeling

Average-case complexity of shortest-paths problems in the vertex-potential model

Random sampling of Euler tours

A combinatorial consistency lemma with application to proving the PCP theorem

Randomization and Approximation Techniques in Computer Science - Lecture Notes in Computer Science
Latest Publications