Sciweavers

2629 search results - page 25 / 526
» complex 2009
Sort
View
ECCC
2011
189views ECommerce» more  ECCC 2011»
13 years 4 months ago
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
Oded Goldreich, Or Meir
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 4 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
CSR
2009
Springer
14 years 4 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
COMPGEOM
2009
ACM
14 years 2 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
LICS
2009
IEEE
14 years 4 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh