Volume 20; Issue 5

SIAM Journal on Computing

Volume 20; Issue 5
1

Selection Networks

Year:
1991
Language:
english
File:
PDF, 1.41 MB
english, 1991
2

An Output-Sensitive Algorithm for Computing Visibility Graphs

Year:
1991
Language:
english
File:
PDF, 2.83 MB
english, 1991
3

Learning Simple Concepts under Simple Distributions

Year:
1991
Language:
english
File:
PDF, 2.97 MB
english, 1991
4

On the Communication Complexity of Solving a Polynomial Equation

Year:
1991
Language:
english
File:
PDF, 1.63 MB
english, 1991
5

The Spectra of Infinite Hypertrees

Year:
1991
Language:
english
File:
PDF, 1.23 MB
english, 1991
6

On the Complexity of Learning Minimum Time-Bounded Turing Machines

Year:
1991
Language:
english
File:
PDF, 3.22 MB
english, 1991
7

Minimum Diameter Spanning Trees and Related Problems

Year:
1991
Language:
english
File:
PDF, 1.20 MB
english, 1991
8

Erratum: Factoring Polynomials over Algebraic Number Fields

Year:
1991
Language:
english
File:
PDF, 47 KB
english, 1991
9

The Maximum Size of Dynamic Data Structures

Year:
1991
Language:
english
File:
PDF, 1.55 MB
english, 1991
10

Time Complexity of Boolean Functions on CREW PRAM s

Year:
1991
Language:
english
File:
PDF, 1.12 MB
english, 1991
11

Embedding of Grids into Optimal Hypercubes

Year:
1991
Language:
english
File:
PDF, 3.07 MB
english, 1991
12

PP is as Hard as the Polynomial-Time Hierarchy

Year:
1991
Language:
english
File:
PDF, 1.43 MB
english, 1991