Sciweavers

4352 search results - page 439 / 871
» A Representation Theorem and Applications
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CAD
2007
Springer
15 years 6 months ago
Computing general geometric structures on surfaces using Ricci flow
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
Miao Jin, Feng Luo 0002, Xianfeng David Gu
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 6 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
ENTCS
2007
153views more  ENTCS 2007»
15 years 6 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 6 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen