1972 search results - page 279 / 395 » connection 2008 |
215
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
200
click to vote
SIAMDM
2010
15 years 4 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
202
click to vote
SIAMSC
2010
15 years 4 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
157
click to vote
SYNTHESE
2010
15 years 4 months ago
2010
Recent work in the philosophy of science has generated an apparent conflict between theories attempting to explicate the nature of scientific representation. On one side, there are...
156
click to vote
SYNTHESE
2010
15 years 4 months ago
2010
Throughout more than two millennia philosophers adhered massively to ideal standards of scientific rationality going back ultimately to Aristotle’s Analytica posteriora. These s...