Sciweavers

1537 search results - page 29 / 308
» On sets not belonging to algebras
Sort
View
DLT
2004
13 years 9 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
14 years 8 months ago
Computing the first Betti number and the connected components of semi-algebraic sets
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...
Saugata Basu, Richard Pollack, Marie-Franço...
AML
2006
83views more  AML 2006»
13 years 7 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
ACMMPC
2000
Springer
238views Mathematics» more  ACMMPC 2000»
13 years 12 months ago
Ordered Sets and Complete Lattices
Abstract. These notes deal with an interconnecting web of mathematical techniques all of which deserve a place in the armoury of the welleducated computer scientist. The objective ...
Hilary A. Priestley
ISSAC
2009
Springer
171views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Computing cylindrical algebraic decomposition via triangular decomposition
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
Changbo Chen, Marc Moreno Maza, Bican Xia, Lu Yang