Sciweavers

24 search results - page 1 / 5
» mfcs 2010
Sort
View
82
Voted
MFCS
2010
Springer
14 years 11 months ago
Least and Greatest Solutions of Equations over Sets of Integers
Artur Jez, Alexander Okhotin
70
Voted
MFCS
2010
Springer
14 years 11 months ago
The Multivariate Resultant Is NP-hard in Any Characteristic
Bruno Grenet, Pascal Koiran, Natacha Portier
87
Voted
MFCS
2010
Springer
14 years 11 months ago
On the Topological Complexity of MSO+U and Related Automata Models
Szczepan Hummel, Michal Skrzypczak, Szymon Toruncz...
114
Voted
MFCS
2010
Springer
14 years 11 months ago
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
Philippe Schnoebelen