5592 search results - page 1064 / 1119 » On Random Betweenness Constraints |
142
click to vote
ALT
2001
Springer
16 years 1 months ago
2001
Springer
The main question addressed in the present work is how to find effectively a recursive function separating two sets drawn arbitrarily from a given collection of disjoint sets. I...
147
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
143
click to vote
LCTRTS
2010
Springer
15 years 11 months ago
2010
Springer
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
121
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
142
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...