OpenAlex
PricingAboutJobs
Log inGet started
Work

Lecture 9

HTML

Type: article
Author: Jonathan Katz
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: permanent, #P-completeness, counting problems, perfect matchings, bipartite graphs, cycle covers, directed graphs, computational hardness

Open Access status: closed
OpenAlex ID: W7095515051
Cites:
Cited by:
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