Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2904771
Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2012.302zbMath1245.68100MaRDI QIDQ2904771

Leslie Ann Goldberg, Andrei A. Bulatov, Martin Dyer, Mark R. Jerrum

Publication date: 23 August 2012


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityapproximationcounting constraint satisfaction problems


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (2)

Boolean max-co-clones ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2904771&oldid=15871229"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki