Sciweavers

923 search results - page 19 / 185
» On a generalization of Stickelberger's Theorem
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 1 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
JAPLL
2010
126views more  JAPLL 2010»
13 years 1 months ago
Justification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine thes...
Melvin Fitting
COMPGEOM
2011
ACM
12 years 10 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
CORR
2006
Springer
77views Education» more  CORR 2006»
13 years 6 months ago
Generalized Entropy Power Inequalities and Monotonicity Properties of Information
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
Mokshay M. Madiman, Andrew R. Barron
JCT
2000
81views more  JCT 2000»
13 years 6 months ago
Generalized Rook Polynomials
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
Jay Goldman, James Haglund