Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
26
search results - page 1 / 6
»
mfcs 2004
Sort
relevance
views
votes
recent
update
View
thumb
title
118
click to vote
MFCS
2004
Springer
98
views
Theoretical Computer Science
»
more
MFCS 2004
»
Congestion Games and Coordination Mechanisms
15 years 8 months ago
Download
www.cs.tau.ac.il
Elias Koutsoupias
claim paper
Read More »
108
click to vote
MFCS
2004
Springer
93
views
Theoretical Computer Science
»
more
MFCS 2004
»
On Pseudovarieties of Semiring Homomorphisms
15 years 8 months ago
Download
www.math.muni.cz
Libor Polák
claim paper
Read More »
90
click to vote
MFCS
2004
Springer
111
views
Theoretical Computer Science
»
more
MFCS 2004
»
Algebraic Recognizability of Languages
15 years 8 months ago
Download
www.labri.fr
Pascal Weil
claim paper
Read More »
94
click to vote
MFCS
2004
Springer
89
views
Theoretical Computer Science
»
more
MFCS 2004
»
Polynomial Time Approximation Schemes and Parameterized Complexity
15 years 8 months ago
Download
faculty.cs.tamu.edu
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
claim paper
Read More »
110
click to vote
MFCS
2004
Springer
123
views
Theoretical Computer Science
»
more
MFCS 2004
»
Approximating Boolean Functions by OBDDs
15 years 8 months ago
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 »