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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
93
Voted
CIAC
2006
Springer
75
views
Algorithms
»
more
CIAC 2006
»
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
15 years 6 months ago
Download
www.lri.fr
Katalin Friedl, Gábor Ivanyos, Miklos Santh
Real-time Traffic
Algorithms
|
CIAC 2006
|
claim paper
Related Content
»
Settling the Complexity of Computing TwoPlayer Nash Equilibria
»
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
more »
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2006
Where
CIAC
Authors
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision