Gems of Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

28

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642643521, 9783642603228

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fundamental Definitions and Results

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_1 ◽

1998 ◽

pp. 1-8

Author(s):

Uwe Schöning ◽

Randall Pruim

Download Full-text

LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_6 ◽

1998 ◽

pp. 41-47

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Random Walks ◽

Random Walks On Graphs

Download Full-text

Spectral Problems and Descriptive Complexity Theory

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_8 ◽

1998 ◽

pp. 61-70

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Complexity Theory ◽

Descriptive Complexity ◽

Spectral Problems

Download Full-text

The BP-Operator and the Power of Counting Classes

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_20 ◽

1998 ◽

pp. 163-174

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Counting Classes

Download Full-text

PAC-Learning and Occam’s Razor

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_11 ◽

1998 ◽

pp. 85-90

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Pac Learning ◽

Occam’S Razor ◽

Occam's Razor

Download Full-text

Exponential Lower Bounds for the Length of Resolution Proofs

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_7 ◽

1998 ◽

pp. 49-60

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Lower Bounds ◽

Resolution Proofs

Download Full-text

Probabilistic Algorithms, Probability Amplification, and the Recycling of Random Numbers

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_18 ◽

1998 ◽

pp. 141-151

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Random Numbers ◽

Probabilistic Algorithms

Download Full-text

P ≠ NP with probability 1

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_23 ◽

1998 ◽

pp. 191-195

Author(s):

Uwe Schöning ◽

Randall Pruim

Download Full-text

Interactive Proofs and Zero Knowledge

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_21 ◽

1998 ◽

pp. 175-182

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Zero Knowledge ◽

Interactive Proofs

Download Full-text

Hilbert’s Tenth Problem

Gems of Theoretical Computer Science ◽

10.1007/978-3-642-60322-8_3 ◽

1998 ◽

pp. 15-23

Author(s):

Uwe Schöning ◽

Randall Pruim

Keyword(s):

Hilbert's Tenth Problem ◽

Hilbert’S Tenth Problem

Download Full-text