Sciweavers

1559 search results - page 21 / 312
» Some Group Theory Problems
Sort
View
LPAR
2010
Springer
14 years 8 months ago
Polite Theories Revisited
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
Dejan Jovanovic, Clark Barrett
HT
2005
ACM
15 years 3 months ago
What the geeks know: hypertext and the problem of literacy
Recent theories of hypertext usefully emphasize continuity with earlier media; but in the general social environment, this continuity is not well understood, and may even be oppos...
Stuart Moulthrop
JCO
2008
98views more  JCO 2008»
14 years 9 months ago
A survey on nonadaptive group testing algorithms through the angle of decoding
Abstract Group testing, sometimes called pooling design, has been applied to a variety of problems such as blood testing, multiple access communication, coding theory, among others...
Hong-Bin Chen, Frank K. Hwang
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 2 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
66
Voted
GROUP
2003
ACM
15 years 2 months ago
Data at work: supporting sharing in science and engineering
Data are a fundamental component of science and engineering work, and the ability to share data is critical to the validation and progress of science. Data sharing and reuse in so...
Jeremy P. Birnholtz, Matthew J. Bietz