Sciweavers

2430 search results - page 63 / 486
» Computing Tutte Polynomials
Sort
View
ICCAD
2004
IEEE
121views Hardware» more  ICCAD 2004»
15 years 11 months ago
Factoring and eliminating common subexpressions in polynomial expressions
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
BIRTHDAY
2007
Springer
15 years 8 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
ICMS
2010
15 years 12 days ago
Efficient Evaluation of Large Polynomials
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
Charles E. Leiserson, Liyun Li, Marc Moreno Maza, ...
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
15 years 8 months ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ECCC
2006
71views more  ECCC 2006»
15 years 2 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...