Sciweavers

4378 search results - page 18 / 876
» On the Complexity of Ordered Colourings
Sort
View
AML
2007
77views more  AML 2007»
13 years 9 months ago
Complex analysis in subsystems of second order arithmetic
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
Keita Yokoyama
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 8 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
14 years 1 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
CIE
2009
Springer
14 years 3 months ago
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Manuel Bodirsky, Miki Hermann, Florian Richoux
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 27 days ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima