1071 search results - page 18 / 215 » Theories of Automatic Structures and Their Complexity |
SARA
2000
Springer
13 years 11 months ago
2000
Springer
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
COMPGEOM
2001
ACM
13 years 11 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
CG
2004
Springer
13 years 7 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
KBSE
2008
IEEE
14 years 2 months ago
2008
IEEE
—Automatic white-box test generation is a challenging problem. Many existing tools rely on complex code analyses and heuristics. As a result, structural features of an input prog...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
14 years 2 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...