Sciweavers

215 search results - page 36 / 43
» Quantum computers that can be simulated classically in polyn...
Sort
View
ENGL
2008
97views more  ENGL 2008»
13 years 7 months ago
Hybrid Surface Reconstruction Technique for Automotive Applications
Reverse engineering has become a viable technique to create a 3D virtual model of an existing physical object. It enables the reconstruction of body surfaces to create a suitable C...
Gregory M. Lecrivain, Ian F. Kennedy, Arezki Slaou...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 1 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
ICDT
2010
ACM
195views Database» more  ICDT 2010»
13 years 11 months ago
Answering Non-Monotonic Queries in Relational Data Exchange
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
André Hernich
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 11 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
ICDCS
2010
IEEE
13 years 7 months ago
Complexity Analysis of Weak Multitolerance
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
Jingshu Chen, Sandeep Kulkarni