Sciweavers

1169 search results - page 38 / 234
» Degrees of monotone complexity
Sort
View
ICIP
2004
IEEE
14 years 10 months ago
Simplified digital holographic reconstruction using statistical methods
For reconstructing a complex object wavefront from digital holograms, we propose a new penalized-likelihood approach based on the measurement statistics and edge-preserving regula...
Jeffrey A. Fessler, Saowapak Sotthivirat
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
ENDM
2010
122views more  ENDM 2010»
13 years 8 months ago
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
Vinícius G. P. de Sá, Celina M. Herr...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 6 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
14 years 23 days ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev