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

scientific article

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

DOI10.4230/LIPICS.STACS.2011.261zbMath1230.68078MaRDI QIDQ3113690

David Richerby, Martin Dyer

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_e955.html

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

zbMATH Keywords

decidabilityconstraint satisfaction problemcomplexity dichotomycounting problems


Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)


Related Items (3)

The complexity of weighted and unweighted \(\#\)CSP ⋮ Spin systems on \(k\)-regular graphs with complex edge functions ⋮ A dichotomy for real weighted Holant problems







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3113690&oldid=16190364"
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:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki