Theoretical Computer Science

16

click to vote

FOCS
1999
IEEE

73views Theoretical Computer Science» more FOCS 1999»

Magic Functions

14 years 4 months ago

Download www.freedomscientific.com

Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. ...

claim paper

Read More »

35

click to vote

FOCS
1999
IEEE

114views Theoretical Computer Science» more FOCS 1999»

Hardness of Approximating the Minimum Distance of a Linear Code

14 years 4 months ago

Download www.ee.ucr.edu

We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...

Ilya Dumer, Daniele Micciancio, Madhu Sudan

claim paper

Read More »

26

click to vote

FOCS
1999
IEEE

102views Theoretical Computer Science» more FOCS 1999»

Learning Mixtures of Gaussians

14 years 4 months ago

Download www.ml.inf.ethz.ch

Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...

Sanjoy Dasgupta

claim paper

Read More »

24

click to vote

FOCS
1999
IEEE

95views Theoretical Computer Science» more FOCS 1999»

Bounds for Small-Error and Zero-Error Quantum Algorithms

14 years 4 months ago

Download homepages.cwi.nl

Harry Buhrman, Richard Cleve, Ronald de Wolf, Chri...

claim paper

Read More »

33

click to vote

FOCS
1999
IEEE

117views Theoretical Computer Science» more FOCS 1999»

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics

14 years 4 months ago

Download www.cc.gatech.edu

We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice

Christian Borgs, Jennifer T. Chayes, Alan M. Friez...

claim paper

Read More »

51

click to vote

FOCS
1999
IEEE

96views Theoretical Computer Science» more FOCS 1999»

A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

14 years 4 months ago

Download www.lsi.upc.edu

This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...

Maria Luisa Bonet, Nicola Galesi

claim paper

Read More »

40

click to vote

FOCS
1999
IEEE

165views Theoretical Computer Science» more FOCS 1999»

An Algorithmic Theory of Learning: Robust Concepts and Random Projection

14 years 4 months ago

Download www-math.mit.edu

We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...

Rosa I. Arriaga, Santosh Vempala

claim paper

Read More »

23

click to vote

FOCS
1999
IEEE

74views Theoretical Computer Science» more FOCS 1999»

A Non-linear Time Lower Bound for Boolean Branching Programs

14 years 4 months ago

Download cs.anu.edu.au

Miklós Ajtai

claim paper