OpenAlex
PricingAboutJobs
Log inGet started
Work

The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems

HTML

Year: 2014
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/focs.2014.70
Authors: Jin-Yi Cai, Heng Guo, Tyson Williams
Institution: University of Wisconsin–Madison
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Holant problems, complexity dichotomy, #P-hardness, planar graphs, Siegel's theorem, Galois groups, Tutte polynomial, Puiseux series

Open Access status: closed

Funders: National Science Foundation, Simons Foundation, Cisco Systems
OpenAlex ID: W2007194013
FWCI: 1.942
Cites: 59
Cited by: 26
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security