Sciweavers

107 search results - page 3 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
CORR
2006
Springer
69views Education» more  CORR 2006»
13 years 5 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas
ESSLLI
2009
Springer
13 years 3 months ago
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
Andreas Schnabl
AML
2005
104views more  AML 2005»
13 years 5 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys
TCS
2011
13 years 7 days ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
13 years 9 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf