Sciweavers

9842 search results - page 58 / 1969
» Problem complexity
Sort
View
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
FOCS
2007
IEEE
14 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
CIE
2009
Springer
14 years 4 months ago
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Manuel Bodirsky, Miki Hermann, Florian Richoux
IJCAI
2003
13 years 11 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
SIAMSC
2008
106views more  SIAMSC 2008»
13 years 9 months ago
Multilevel Linear Sampling Method for Inverse Scattering Problems
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
Jingzhi Li, Hongyu Liu, Jun Zou