70 search results - page 14 / 14 » A computational introduction to number theory and algebra |
SODA
2010
ACM
13 years 3 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
Spreadsheets are among the most commonly used applications for data management and analysis. Perhaps they are even among the most widely used computer applications of all kinds. H...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
ACS
2007
13 years 5 months ago
2007
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...