1461 search results - page 90 / 293 » Complexity of Graph Covering Problems |
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
IMR
2007
Springer
14 years 1 months ago
2007
Springer
Unstructured hexahedral mesh generation is a critical part of the modeling process in the Spectral-Element Method (SEM). We present some examples of seismic wave propagation in co...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
FOCS
2000
IEEE
14 years 4 days ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...