2877 search results - page 32 / 576 » The Complexity of Planarity Testing |
JC
2010
14 years 9 months ago
2010
DCG
2006
14 years 11 months ago
2006
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— Moments are generic (and usually intuitive) descriptors that can be computed from several kinds of objects defined either from closed contours or from a set of points. In this...
COCO
2004
Springer
15 years 4 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...