3172 search results - page 71 / 635 » On the Random-Self-Reducibility of Complete Sets |
79
Voted
AMC
2005
15 years 20 days ago
2005
A constructive algorithm for the completion of arbitrary algebraic partial differential equation systems to involutive ones are presented. Based on it, an implementation ICS for c...
95
Voted
AML
2006
15 years 25 days ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
80
Voted
AML
2005
15 years 20 days ago
2005
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
108
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
KI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...