8582 search results - page 13 / 1717 » Here or There |
ALGORITHMICA
2010
13 years 8 months ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In order to better understand reasoning involved in analyzing infinite games in extensive form, we performed the experiments in proof assistant Coq that are reported here.
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orde...
SIGIR
2002
ACM
13 years 8 months ago
2002
ACM
We organized a workshop at SIGIR'01 to explore the area of information retrieval techniques for speech applications. Here we summarize the results of that workshop
PROPERTYTESTING
2010
13 years 6 months ago
2010
We survey here property testing results for the so called 'massively parametrized' model (or problems). This paper is based on a survey talk gave at the workshop on prop...