Sciweavers

26 search results - page 1 / 6

» mfcs 2004

15

MFCS
2004
Springer

98views Theoretical Computer Science» more MFCS 2004»

Congestion Games and Coordination Mechanisms

13 years 10 months ago

Congestion Games and Coordination Mechanisms

Download www.cs.tau.ac.il

Elias Koutsoupias

claim paper

Read More »

13

MFCS
2004
Springer

93views Theoretical Computer Science» more MFCS 2004»

On Pseudovarieties of Semiring Homomorphisms

13 years 10 months ago

On Pseudovarieties of Semiring Homomorphisms

Download www.math.muni.cz

Libor Polák

claim paper

Read More »

12

MFCS
2004
Springer

111views Theoretical Computer Science» more MFCS 2004»

Algebraic Recognizability of Languages

13 years 10 months ago

Algebraic Recognizability of Languages

Download www.labri.fr

Pascal Weil

claim paper

Read More »

10

MFCS
2004
Springer

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

13 years 10 months ago

Polynomial Time Approximation Schemes and Parameterized Complexity

Download faculty.cs.tamu.edu

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

claim paper

Read More »

13

MFCS
2004
Springer

123views Theoretical Computer Science» more MFCS 2004»

Approximating Boolean Functions by OBDDs

13 years 10 months ago

Approximating Boolean Functions by OBDDs

Download www.cs.bham.ac.uk

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

claim paper

Read More »

« Prev « First page 1 / 6 Last » Next »