Sciweavers

3415 search results - page 86 / 683
» Lower Bounds for Kernelizations
Sort
View
109
Voted
FOCS
1991
IEEE
15 years 4 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
88
Voted
SPDP
1991
IEEE
15 years 4 months ago
Lower bounds and parallel algorithms for planar orthogonal grid drawings
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
APPROX
2008
Springer
79views Algorithms» more  APPROX 2008»
15 years 2 months ago
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
Vikraman Arvind, Partha Mukhopadhyay
COCO
2008
Springer
81views Algorithms» more  COCO 2008»
15 years 2 months ago
Amplifying Lower Bounds by Means of Self-Reducibility
Eric Allender, Michal Koucký