AI Chat AI Image Generator AI Video Text to Speech

Counting Polygon Triangulations is Hard

03/12/2019
∙
by   David Eppstein, et al.
∙
0
∙

We prove that it is #P-complete to count the triangulations of a (non-simple) polygon.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 10/10/2020

The Complexity of Counting Edge Colorings for Simple Graphs

We prove #P-completeness results for counting edge colorings on simple g...
0 Jin-Yi Cai, et al. ∙
research
∙ 11/24/2017

Relating counting complexity to non-uniform probability measures

A standard method for designing randomized algorithms to approximately c...
0 Eleni Bakali, et al. ∙
research
∙ 06/17/2020

Overcoming Statistical Shortcuts for Open-ended Visual Counting

Machine learning models tend to over-rely on statistical shortcuts. Thes...
12 Corentin Dancette, et al. ∙
research
∙ 12/05/2008

An analysis of a random algorithm for estimating all the matchings

Counting the number of all the matchings on a bipartite graph has been t...
0 Jinshan Zhang, et al. ∙
research
∙ 04/07/2021

Polynomial Anonymous Dynamic Distributed Computing without a Unique Leader

Counting the number of nodes in Anonymous Dynamic Networks is enticing f...
0 Dariusz R. Kowalski, et al. ∙
research
∙ 03/09/2017

Impact of URI Canonicalization on Memento Count

Quantifying the captures of a URI over time is useful for researchers to...
0 Mat Kelly, et al. ∙
research
∙ 07/07/2020

CrossCount: A Deep Learning System for Device-free Human Counting using WiFi

Counting humans is an essential part of many people-centric applications...
0 Osama T. Ibrahim, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal