Sciweavers

10997 search results - page 119 / 2200
» On the Structure of Complete Sets
Sort
View
AMC
2005
120views more  AMC 2005»
15 years 6 months ago
ICS: a package for computing involutive characteristic set of algebraic partial differential equation systems
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...
Shan-Qing Zhang, Gui-Xu Zhang, Zhi-Bin Li
CBSE
2007
Springer
16 years 9 days ago
Binary Change Set Composition
Binary component-based software updates that are efficient, safe and generic still remain a challenge. Most existing deployment systems that achieve this goal have to control the c...
Tijs van der Storm
AML
2006
83views more  AML 2006»
15 years 6 months ago
The Medvedev lattice of computably closed sets
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...
Sebastiaan Terwijn
AML
2005
53views more  AML 2005»
15 years 6 months ago
Models of set theory with definable ordinals
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...
Ali Enayat
154
Voted
CCCG
2009
15 years 4 months ago
On symmetric realizations of the simplicial complex of 3-crossing-free sets of diagonals of the octagon
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
Jürgen Bokowski, Vincent Pilaud