177 search results - page 11 / 36 » Logical complexity of graphs: a survey |
MFCS
2001
Springer
14 years 4 days ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
ESA
2003
Springer
14 years 28 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ISPA
2007
Springer
14 years 1 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also suppo...
ASP
2005
Springer
14 years 1 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...