Product
Help
Pricing
About
Jobs
Log in
Get started
Work
Add to collection
Lecture 9
HTML
Details
Locations
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
show all 8
Open Access status:
closed
OpenAlex ID:
W7095515051
Cites:
Cited by:
Related to:
10