Volume 26; Issue 3

SIAM Journal on Computing

Volume 26; Issue 3
1

A Pumping Condition for Regular Sets

Year:
1997
Language:
english
File:
PDF, 237 KB
english, 1997
2

Leader Election in Complete Networks

Year:
1997
Language:
english
File:
PDF, 272 KB
english, 1997
3

The Cost of Derandomization: Computability or Competitiveness

Year:
1997
Language:
english
File:
PDF, 315 KB
english, 1997
4

Tighter Upper Bounds on the Exact Complexity of String Matching

Year:
1997
Language:
english
File:
PDF, 751 KB
english, 1997
5

Boolean Circuits, Tensor Ranks, and Communication Complexity

Year:
1997
Language:
english
File:
PDF, 481 KB
english, 1997
6

Thek-Steiner Ratio in Graphs

Year:
1997
Language:
english
File:
PDF, 293 KB
english, 1997
9

Size--Depth Tradeoffs for Threshold Circuits

Year:
1997
Language:
english
File:
PDF, 362 KB
english, 1997
10

Bounds for the Computational Power and Learning Complexity of Analog Neural Nets

Year:
1997
Language:
english
File:
PDF, 486 KB
english, 1997
11

On the Amount of Nondeterminism and the Power of Verifying

Year:
1997
Language:
english
File:
PDF, 394 KB
english, 1997
12

Bounds on the Number of Examples Needed for Learning Functions

Year:
1997
Language:
english
File:
PDF, 321 KB
english, 1997
13

Ray Shooting Amidst Spheres in Three Dimensions and Related Problems

Year:
1997
Language:
english
File:
PDF, 398 KB
english, 1997
14

On the Complexity of Finding a Minimum Cycle Cover of a Graph

Year:
1997
Language:
english
File:
PDF, 163 KB
english, 1997