10988 search results - page 228 / 2198 » Algorithmic Folding Complexity |
109
click to vote
ENDM
2010
15 years 1 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
214
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
135
click to vote
CONSTRAINTS
1998
15 years 3 months ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
143
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
134
click to vote
SBCCI
2009
ACM
15 years 8 months ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...