Sciweavers

1379 search results - page 75 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
WICON
2008
15 years 2 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
106
Voted
AML
2006
106views more  AML 2006»
15 years 20 days ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
142
Voted
IWPEC
2010
Springer
14 years 10 months ago
Multivariate Complexity Analysis of Swap Bribery
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Britta Dorn, Ildikó Schlotter
ICIP
1998
IEEE
16 years 2 months ago
Complex Representations of Algebraic Curves
In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be deter...
Mustafa Unel, William A. Wolovich
96
Voted
FLOPS
2010
Springer
15 years 7 months ago
Complexity Analysis by Graph Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
Martin Avanzini, Georg Moser