Sciweavers

26 search results - page 1 / 6
» mfcs 2004
Sort
View
90
Voted
MFCS
2004
Springer
15 years 4 months ago
Congestion Games and Coordination Mechanisms
Elias Koutsoupias
66
Voted
MFCS
2004
Springer
15 years 4 months ago
Algebraic Recognizability of Languages
Pascal Weil
66
Voted
MFCS
2004
Springer
15 years 4 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
67
Voted
MFCS
2004
Springer
15 years 4 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier