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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
24
search results - page 1 / 5
»
mfcs 2010
Sort
relevance
views
votes
recent
update
View
thumb
title
29
click to vote
MFCS
2010
Springer
121
views
Theoretical Computer Science
»
more
MFCS 2010
»
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
13 years 9 months ago
Download
ccc.cs.uni-duesseldorf.de
Nadja Betzler
claim paper
Read More »
26
click to vote
MFCS
2010
Springer
105
views
Theoretical Computer Science
»
more
MFCS 2010
»
Least and Greatest Solutions of Equations over Sets of Integers
13 years 9 months ago
Download
users.utu.fi
Artur Jez, Alexander Okhotin
claim paper
Read More »
19
click to vote
MFCS
2010
Springer
139
views
Theoretical Computer Science
»
more
MFCS 2010
»
The Multivariate Resultant Is NP-hard in Any Characteristic
13 years 9 months ago
Download
www.cs.toronto.edu
Bruno Grenet, Pascal Koiran, Natacha Portier
claim paper
Read More »
30
click to vote
MFCS
2010
Springer
129
views
Theoretical Computer Science
»
more
MFCS 2010
»
On the Topological Complexity of MSO+U and Related Automata Models
13 years 9 months ago
Download
www.mimuw.edu.pl
Szczepan Hummel, Michal Skrzypczak, Szymon Toruncz...
claim paper
Read More »
37
click to vote
MFCS
2010
Springer
152
views
Theoretical Computer Science
»
more
MFCS 2010
»
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
13 years 9 months ago
Download
www.lsv.ens-cachan.fr
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen
claim paper
Read More »
« Prev
« First
page 1 / 5
Last »
Next »