Sciweavers

16666 search results - page 259 / 3334
» Descriptive and Computational Complexity
Sort
View
99
Voted
MFCS
2005
Springer
16 years 3 days ago
Complexity Bounds for Regular Games
Paul Hunter, Anuj Dawar
ICALP
2004
Springer
15 years 12 months ago
The Complexity of Partition Functions
Andrei A. Bulatov, Martin Grohe
ASAP
2003
IEEE
89views Hardware» more  ASAP 2003»
15 years 12 months ago
Complex Division with Prescaling of Operands
Jean-Michel Muller
FOCS
1991
IEEE
15 years 10 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