Home
Random
Nearby
Log in
Settings
Donate
About Wikidata
Disclaimers
Search
(Q56323782)
Watch
English
The complexity of approximating conservative counting CSPs
article published in 2015
In more languages
edit
Statements
instance of
scholarly article
0 references
title
The complexity of approximating conservative counting CSPs
(English)
0 references
author
Martin Dyer
object named as
Martin Dyer
series ordinal
2
0 references
Leslie Ann Goldberg
series ordinal
3
object named as
Leslie Ann Goldberg
0 references
author name string
Xi Chen
series ordinal
1
0 references
Mark Jerrum
series ordinal
4
0 references
Pinyan Lu
series ordinal
5
0 references
Colin McQuillan
series ordinal
6
0 references
David Richerby
series ordinal
7
0 references
publication date
February 2015
0 references
full work available at URL
http://eprints.whiterose.ac.uk/89268
content deliverer
White Rose Research Online
object has role
postprint
copyright license
Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International
0 references
published in
Journal of Computer and System Sciences
0 references
volume
81
0 references
page(s)
311-329
0 references
issue
1
0 references
maintained by WikiProject
WikiProject Mathematics
0 references
Identifiers
DOI
10.1016/J.JCSS.2014.06.006
0 references
Altmetric DOI
10.1016/J.JCSS.2014.06.006
0 references
arXiv ID
1208.1783
0 references
CORE ID
9258202
0 references
DBLP publication ID
journals/jcss/ChenDGJLMR15
1 reference
stated in
DBLP Dataset 2021-01-02
retrieved
28 January 2021
Dimensions Publication ID
1006901629
0 references
Microsoft Academic ID
1937281308
0 references
ResearchGate publication ID
230639359
0 references
Scopus EID
2-s2.0-84940223609
0 references
zbMATH Open document ID
1354.68114
0 references
Sitelinks
Wikipedia
(0 entries)
edit
Wikibooks
(0 entries)
edit
Wikinews
(0 entries)
edit
Wikiquote
(0 entries)
edit
Wikisource
(0 entries)
edit
Wikiversity
(0 entries)
edit
Wikivoyage
(0 entries)
edit
Wiktionary
(0 entries)
edit
Multilingual sites
(0 entries)
edit