Some #P completeness proofs for colourings and independent sets

On completeness for NP via projection translations

Stewart, I
Newcastle upon Tyne Univ. (United Kingdom). Computing Lab

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:8724.9(UNUT-CL-TRS--323) / BLDSC - B...

On colour categorisation

Pilling, M.

January 2001

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

Equality proofing issues

National Economic and Social Forum, Dublin (Ireland)

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:40424.1020(10) / BLDSC - British Libr...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

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

Uniquely completable and critical sets for graph colourings and Latin squares

Burgess, D.

January 1998

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

Colour constancy in simple complex scenes

Bramwell, D.

January 1997

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

Colourings, complexity, and some related topics

Sanchez-Arroyo, A

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:D94184 / BLDSC - British Library Doc...

Proving ground completeness of resolution by proof planning

Kerber, M.
Sehn, A.C.
Birmingham Univ. (United Kingdom). School of Computer Science

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:3292.8854(CSRP-96-16) / BLDSC - Briti...

Verification of diagrammatic proofs

Jamnik, M.
Bundy, A.
Green, I.
Edinburgh Univ. (United Kingdom). Dept. of Artificial Intelligence

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:3511.638(924) / BLDSC - British Libra...

Some aspects of B-completeness and the closed graph theorem

Saiflu, H

January 1980

SIGLEAvailable from British Library Document Supply Centre- DSC:D36407/81 / BLDSC - British Library ...

Approaches to the four colour theorem

Loupekine, F

January 1992

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

On proving limiting completeness

Mosses, P.D.
Plotkin, G.D
Edinburgh Univ. (United Kingdom). Dept. of Computer Science

January 1984

SIGLEAvailable from British Library Lending Division - LD:4534.9203(CSR--177-84) / BLDSC - British L...

Studies in the completeness and efficiency of theorem-proving by resolution

Kowalski, R

January 1970

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

The theory of colouration of textiles

Johnson, A, (ed.)
Society of Dyers and Colourists (SDC), Bradford (United Kingdom)

January 1989

SIGLEAvailable from British Library Document Supply Centre- DSC:89/26451(Theory) / BLDSC - British L...

Graph colourings using structured colour sets

Johnson, A.

January 2001

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

On completeness for NP via projection translations

Stewart, I
Newcastle upon Tyne Univ. (United Kingdom). Computing Lab

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:8724.9(UNUT-CL-TRS--323) / BLDSC - B...

On colour categorisation

Pilling, M.

January 2001

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

Equality proofing issues

National Economic and Social Forum, Dublin (Ireland)

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:40424.1020(10) / BLDSC - British Libr...

2-colourings and other combinatorial problems

Tarlow, B.

January 1998

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

Uniquely completable and critical sets for graph colourings and Latin squares

Burgess, D.

January 1998

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

Colour constancy in simple complex scenes

Bramwell, D.

January 1997

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

Colourings, complexity, and some related topics

Sanchez-Arroyo, A

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:D94184 / BLDSC - British Library Doc...

Proving ground completeness of resolution by proof planning

Kerber, M.
Sehn, A.C.
Birmingham Univ. (United Kingdom). School of Computer Science

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:3292.8854(CSRP-96-16) / BLDSC - Briti...

Verification of diagrammatic proofs

Jamnik, M.
Bundy, A.
Green, I.
Edinburgh Univ. (United Kingdom). Dept. of Artificial Intelligence

January 1998

SIGLEAvailable from British Library Document Supply Centre-DSC:3511.638(924) / BLDSC - British Libra...

Some aspects of B-completeness and the closed graph theorem

Saiflu, H

January 1980

SIGLEAvailable from British Library Document Supply Centre- DSC:D36407/81 / BLDSC - British Library ...

Approaches to the four colour theorem

Loupekine, F

January 1992

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

On proving limiting completeness

Mosses, P.D.
Plotkin, G.D
Edinburgh Univ. (United Kingdom). Dept. of Computer Science

January 1984

SIGLEAvailable from British Library Lending Division - LD:4534.9203(CSR--177-84) / BLDSC - British L...

Studies in the completeness and efficiency of theorem-proving by resolution

Kowalski, R

January 1970

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

The theory of colouration of textiles

Johnson, A, (ed.)
Society of Dyers and Colourists (SDC), Bradford (United Kingdom)

January 1989

SIGLEAvailable from British Library Document Supply Centre- DSC:89/26451(Theory) / BLDSC - British L...

Graph colourings using structured colour sets

Johnson, A.

January 2001

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

On completeness for NP via projection translations

Stewart, I
Newcastle upon Tyne Univ. (United Kingdom). Computing Lab

January 1991

SIGLEAvailable from British Library Document Supply Centre- DSC:8724.9(UNUT-CL-TRS--323) / BLDSC - B...

On colour categorisation

Pilling, M.

January 2001

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

Equality proofing issues

National Economic and Social Forum, Dublin (Ireland)

January 1996

SIGLEAvailable from British Library Document Supply Centre-DSC:40424.1020(10) / BLDSC - British Libr...

Some #P completeness proofs for colourings and independent sets

Abstract

Extracted data

Some #P completeness proofs for colourings and independent sets

Abstract

Extracted data

Related items

Related items