Sciweavers

3415 search results - page 86 / 683
» Lower Bounds for Kernelizations
Sort
View
FOCS
1991
IEEE
15 years 7 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
SPDP
1991
IEEE
15 years 7 months ago
Lower bounds and parallel algorithms for planar orthogonal grid drawings
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
103
Voted
APPROX
2008
Springer
79views Algorithms» more  APPROX 2008»
15 years 6 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 5 months ago
Amplifying Lower Bounds by Means of Self-Reducibility
Eric Allender, Michal Koucký