281 search results - page 34 / 57 » The Complexity of Planar Counting Problems |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
DAC
1999
ACM
14 years 2 days ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Motivated by an error-recovery locomotion problem, we propose a control technique for a complex mechanical system by decomposing the system dynamics into a collection of simpli...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...