Sciweavers

730 search results - page 22 / 146
» Combinatorics of Monotone Computations
Sort
View
BIRTHDAY
1999
Springer
14 years 28 days ago
Monotonicity in Calculational Proofs
We discuss the use of weakening and strengthening steps in calculational proofs. We present a metatheorem concerning monotonicity of positions in a formula that should have a more...
David Gries
CIE
2006
Springer
14 years 11 days ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
CONCUR
2010
Springer
13 years 9 months ago
Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification
ned Monotonic Abstraction: a CEGAR for Parameterized Verification Parosh Aziz Abdulla1 , Yu-Fang Chen2 , Giorgio Delzanno3 , Fr
Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzann...
COMBINATORICS
2004
106views more  COMBINATORICS 2004»
13 years 8 months ago
Random Matrices, Magic Squares and Matching Polynomials
Characteristic polynomials of random unitary matrices have been intensively studied in recent years: by number theorists in connection with Riemann zetafunction, and by theoretica...
Persi Diaconis, Alexander Gamburd
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 8 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers