Volume 38; Issue 3

SIAM Journal on Computing

Volume 38; Issue 3
3

On Approximating the Depth and Related Problems

Year:
2008
Language:
english
File:
PDF, 332 KB
english, 2008
6

Simulating Quantum Computation by Contracting Tensor Networks

Year:
2008
Language:
english
File:
PDF, 260 KB
english, 2008
7

Efficient Colored Orthogonal Range Counting

Year:
2008
Language:
english
File:
PDF, 365 KB
english, 2008
8

Finding Branch-Decompositions and Rank-Decompositions

Year:
2008
Language:
english
File:
PDF, 292 KB
english, 2008
9

Query-Efficient Algorithms for Polynomial Interpolation over Composites

Year:
2008
Language:
english
File:
PDF, 268 KB
english, 2008
10

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Year:
2008
Language:
english
File:
PDF, 202 KB
english, 2008
11

Exact Algorithms for Treewidth and Minimum Fill-In

Year:
2008
Language:
english
File:
PDF, 271 KB
english, 2008
12

I/O-Efficient Planar Separators

Year:
2008
Language:
english
File:
PDF, 602 KB
english, 2008
13

Dimensions of Points in Self-Similar Fractals

Year:
2008
Language:
english
File:
PDF, 520 KB
english, 2008
14

Approximate Shortest Paths in Anisotropic Regions

Year:
2008
Language:
english
File:
PDF, 310 KB
english, 2008
16

The Spectral Method for General Mixture Models

Year:
2008
Language:
english
File:
PDF, 222 KB
english, 2008
17

On the Complexity of Verifying Consistency of XML Specifications

Year:
2008
Language:
english
File:
PDF, 451 KB
english, 2008
18

Improved Approximation Algorithms for Broadcast Scheduling

Year:
2008
Language:
english
File:
PDF, 220 KB
english, 2008
19

The Complexity of Monadic Second-Order Unification

Year:
2008
Language:
english
File:
PDF, 544 KB
english, 2008