Sciweavers

1007 search results - page 20 / 202
» The Complexity of Futile Questioning
Sort
View
JUCS
2008
151views more  JUCS 2008»
13 years 9 months ago
The Bit-Complexity of Finding Nearly Optimal Quadrature Rules for Weighted Integration
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...
Volker Bosserhoff
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 3 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
14 years 1 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
CSL
2004
Springer
14 years 3 months ago
Notions of Average-Case Complexity for Random 3-SAT
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
Albert Atserias
FSTTCS
2001
Springer
14 years 2 months ago
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
This paper has the following goals: – To survey some of the recent developments in the field of derandomization. – To introduce a new notion of time-bounded Kolmogorov complex...
Eric Allender