13306 search results - page 470 / 2662 » Theoretical Computer Science |
182
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
188
click to vote
CCA
2000
Springer
16 years 2 hour ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
188
click to vote
ACSC
2000
IEEE
16 years 2 days ago
2000
IEEE
The World Wide Web has transformed itself in the last few years from a simple state-less multimedia platform to a global distributed processing environment. As Web computing gains...
230
click to vote
CSR
2009
Springer
15 years 8 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
206
click to vote
STACS
2000
Springer
15 years 11 months ago
2000
Springer
We investigate self-testing programs with relative error by allowing error terms proportional to the function to be computed. Until now, in numerical computation, error terms were ...