Sciweavers

21 search results - page 1 / 5

» coco 2003

29

COCO
2003
Springer

87views Algorithms» more COCO 2003»

Extracting the Mutual Information for a Triple of Binary Strings

14 years 4 months ago

Extracting the Mutual Information for a Triple of Binary Strings

Download cool.iitp.ru

Andrei E. Romashchenko

claim paper

Read More »

18

COCO
2003
Springer

84views Algorithms» more COCO 2003»

On Statistical Query Sampling and NMR Quantum Computing

14 years 4 months ago

On Statistical Query Sampling and NMR Quantum Computing

Download www.cs.cmu.edu

Ke Yang, Avrim Blum

claim paper

Read More »

27

COCO
2003
Springer

98views Algorithms» more COCO 2003»

The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

14 years 4 months ago

The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

Download www.ti.inf.ethz.ch

Chris Calabro, Russell Impagliazzo, Valentine Kaba...

claim paper

Read More »

21

COCO
2003
Springer

88views Algorithms» more COCO 2003»

On Derandomizing Tests for Certain Polynomial Identities

14 years 4 months ago

On Derandomizing Tests for Certain Polynomial Identities

Download www.cse.iitk.ac.in

We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.

Manindra Agrawal

claim paper

Read More »

27

COCO
2003
Springer

93views Algorithms» more COCO 2003»

Are Cook and Karp Ever the Same?

14 years 4 months ago

Are Cook and Karp Ever the Same?

Download people.cs.uchicago.edu

We consider the question whether there exists a set A such that every set polynomial-time Turing equivalent to A is also many-one equivalent to A. We show that if E = NE then no s...

Richard Beigel, Lance Fortnow

claim paper

Read More »

« Prev « First page 1 / 5 Last » Next »