On the relative complexity of approximate counting problems

Topics in combinatorics and computational complexity

Alfonsin, J.L.R

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:D176434 / BLDSC - British Library Do...

Tighter lower bounds on the exact complexity of string matching

Cole, R.
Hariharan, R.
Paterson, M.
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--241) / BLDSC -...

Children and adults with specific calculation difficulties

Dowker, A.
Economic and Social Research Council (ESRC), Swindon (United Kingdom)

January 1997

SIGLEAvailable from British Library Document Supply Centre-DSC:3739.0605(R000234392) / BLDSC - Briti...

The complexity of counting problems

Annan, J.D

January 1994

SIGLEAvailable from British Library Document Supply Centre- DSC:D183003 / BLDSC - British Library Do...

Practical computational complexity

Symonds, D
Royal Signals and Radar Establishment, Malvern (United Kingdom)

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:5644.91(RSRE-M--4468) / BLDSC - Brit...

Computational complexity

Kronsjo, L
Birmingham Univ. (United Kingdom). School of Computer Science

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:8092.7029(BU-CSR--90-12) / BLDSC - B...

The relative complexity of approximate counting problems

Dyer, Martin
Goldberg, Leslie Ann
Greenhill, Catherine
Jerrum, Mark

March 2004

Two natural classes of counting problems that are interreducible under approximation-preserving redu...

Topics in computational complexity and enumeration

Edwards, K

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:D75147/87 / BLDSC - British Library ...

Topics in computational complexity

Farr, G.E

January 1986

Available from British Library Document Supply Centre- DSC:D69017/86 / BLDSC - British Library Docum...

Conceptual and procedural understanding of counting by pupils with severe learning difficulties

Porter, J.M.

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN009078 / BLDSC - British Library D...

Distributional problems in arithmetic

Haili, H.K.

January 1998

Available from British Library Document Supply Centre-DSC:DXN046239 / BLDSC - British Library Docume...

Investigations into the complexity of some propositional calculi

D'Agostino, M

January 1992

SIGLEAvailable from British Library Document Supply Centre- DSC:D173821 / BLDSC - British Library Do...

The complexity of counting problems in equational matching

Kolaitis, P.G.
Hermann, M.
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1993

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 12515 / INIST-CNRS - ...

The computational complexity of graph theory problems

Holyer, I

January 1981

SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...

Complexity of generalized satisfiability counting problems

Creignou, N.
Hermann, M.
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1993

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 12514 / INIST-CNRS - ...

Topics in combinatorics and computational complexity

Alfonsin, J.L.R

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:D176434 / BLDSC - British Library Do...

Tighter lower bounds on the exact complexity of string matching

Cole, R.
Hariharan, R.
Paterson, M.
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--241) / BLDSC -...

Children and adults with specific calculation difficulties

Dowker, A.
Economic and Social Research Council (ESRC), Swindon (United Kingdom)

January 1997

SIGLEAvailable from British Library Document Supply Centre-DSC:3739.0605(R000234392) / BLDSC - Briti...

The complexity of counting problems

Annan, J.D

January 1994

SIGLEAvailable from British Library Document Supply Centre- DSC:D183003 / BLDSC - British Library Do...

Practical computational complexity

Symonds, D
Royal Signals and Radar Establishment, Malvern (United Kingdom)

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:5644.91(RSRE-M--4468) / BLDSC - Brit...

Computational complexity

Kronsjo, L
Birmingham Univ. (United Kingdom). School of Computer Science

January 1990

SIGLEAvailable from British Library Document Supply Centre- DSC:8092.7029(BU-CSR--90-12) / BLDSC - B...

The relative complexity of approximate counting problems

Dyer, Martin
Goldberg, Leslie Ann
Greenhill, Catherine
Jerrum, Mark

March 2004

Two natural classes of counting problems that are interreducible under approximation-preserving redu...

Topics in computational complexity and enumeration

Edwards, K

January 1986

SIGLEAvailable from British Library Document Supply Centre- DSC:D75147/87 / BLDSC - British Library ...

Topics in computational complexity

Farr, G.E

January 1986

Available from British Library Document Supply Centre- DSC:D69017/86 / BLDSC - British Library Docum...

Conceptual and procedural understanding of counting by pupils with severe learning difficulties

Porter, J.M.

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN009078 / BLDSC - British Library D...

Distributional problems in arithmetic

Haili, H.K.

January 1998

Available from British Library Document Supply Centre-DSC:DXN046239 / BLDSC - British Library Docume...

Investigations into the complexity of some propositional calculi

D'Agostino, M

January 1992

SIGLEAvailable from British Library Document Supply Centre- DSC:D173821 / BLDSC - British Library Do...

The complexity of counting problems in equational matching

Kolaitis, P.G.
Hermann, M.
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1993

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 12515 / INIST-CNRS - ...

The computational complexity of graph theory problems

Holyer, I

January 1981

SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...

Complexity of generalized satisfiability counting problems

Creignou, N.
Hermann, M.
Centre National de la Recherche Scientifique (CNRS), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-1 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Nancy-2 Univ., 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)
Institut National Polytechnique de Lorraine (INPL), 54 - Vandoeuvre-les-Nancy (France). Centre de Recherche en Informatique de Nancy (CRIN)

January 1993

SIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : RP 12514 / INIST-CNRS - ...

Topics in combinatorics and computational complexity

Alfonsin, J.L.R

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:D176434 / BLDSC - British Library Do...

Tighter lower bounds on the exact complexity of string matching

Cole, R.
Hariharan, R.
Paterson, M.
Warwick Univ., Coventry (United Kingdom). Dept. of Computer Science

January 1993

SIGLEAvailable from British Library Document Supply Centre- DSC:7769.09285(WU-DCS-RR--241) / BLDSC -...

Children and adults with specific calculation difficulties

Dowker, A.
Economic and Social Research Council (ESRC), Swindon (United Kingdom)

January 1997

SIGLEAvailable from British Library Document Supply Centre-DSC:3739.0605(R000234392) / BLDSC - Briti...

On the relative complexity of approximate counting problems

Abstract

Extracted data

On the relative complexity of approximate counting problems

Abstract

Extracted data

Related items

Related items