Computational complexity of counting coincidences
Asymptotic enumeration (05A16) Combinatorial inequalities (05A20) Combinatorial aspects of tessellation and tiling problems (05B45) Enumeration in graph theory (05C30) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05)
This page was built for publication: Computational complexity of counting coincidences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6512549)
