2446 search results - page 169 / 490 » Choiceless Polynomial Time |
129
click to vote
ISAAC
1995
Springer
15 years 7 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
128
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
142
click to vote
TSMC
2010
14 years 11 months ago
2010
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...
233
click to vote
SIAMCOMP
2011
14 years 7 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
126
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...