Volume 41; Issue 6

SIAM Journal on Computing

Volume 41; Issue 6
1

Max Cut and the Smallest Eigenvalue

Year:
2012
Language:
english
File:
PDF, 265 KB
english, 2012
2

Agnostic Learning of Monomials by Halfspaces Is Hard

Year:
2012
Language:
english
File:
PDF, 425 KB
english, 2012
3

Transitive-Closure Spanners

Year:
2012
Language:
english
File:
PDF, 779 KB
english, 2012
4

Locality from Circuit Lower Bounds

Year:
2012
Language:
english
File:
PDF, 784 KB
english, 2012
5

On the Hidden Shifted Power Problem

Year:
2012
Language:
english
File:
PDF, 376 KB
english, 2012
6

Reconstructing Approximate Phylogenetic Trees from Quartet Samples

Year:
2012
Language:
english
File:
PDF, 302 KB
english, 2012
7

Fast Information Spreading in Graphs with Large Weak Conductance

Year:
2012
Language:
english
File:
PDF, 326 KB
english, 2012
8

Homology Flows, Cohomology Cuts

Year:
2012
Language:
english
File:
PDF, 636 KB
english, 2012
9

Bit-Probe Lower Bounds for Succinct Data Structures

Year:
2012
Language:
english
File:
PDF, 208 KB
english, 2012
10

Twice-Ramanujan Sparsifiers

Year:
2012
Language:
english
File:
PDF, 258 KB
english, 2012
11

3-Query Locally Decodable Codes of Subexponential Length

Year:
2012
Language:
english
File:
PDF, 199 KB
english, 2012
12

Approximating Edit Distance in Near-Linear Time

Year:
2012
Language:
english
File:
PDF, 248 KB
english, 2012
13

Universally Utility-maximizing Privacy Mechanisms

Year:
2012
Language:
english
File:
PDF, 321 KB
english, 2012
14

Online and Stochastic Survivable Network Design

Year:
2012
Language:
english
File:
PDF, 361 KB
english, 2012
16

New Direct-Product Testers and 2-Query PCPs

Year:
2012
Language:
english
File:
PDF, 573 KB
english, 2012
17

Quantum Query Complexity of Minor-Closed Graph Properties

Year:
2012
Language:
english
File:
PDF, 392 KB
english, 2012