Sciweavers

29908 search results - page 192 / 5982
» On the complexity of communication complexity
Sort
View
ENDM
2006
96views more  ENDM 2006»
15 years 6 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ACTA
2004
97views more  ACTA 2004»
15 years 6 months ago
Past is for free: on the complexity of verifying linear temporal properties with past
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
Nicolas Markey
TSP
2008
99views more  TSP 2008»
15 years 6 months ago
Filter Design With Low Complexity Coefficients
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD)...
Joelle Skaf, Stephen P. Boyd
CG
2004
Springer
15 years 6 months ago
A stratification approach for modeling two-dimensional cell complexes
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
Sinésio Pesco, Geovan Tavares, Hélio...