Search Sciweavers | Sciweavers

1383 search results - page 5 / 277

» On the Complexity of the Interlace Polynomial

click to vote

ICIP
2009
IEEE

186views Image Processing» more ICIP 2009»

Efficient design of 2-D nonseparable filters of low complexity

14 years 7 months ago

Download videoprocessing.ucsd.edu

By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...

Kaveh Fanian, Hoang Duong Tuan, Truong Q. Nguyen

claim paper

Read More »

click to vote

CADE
1992
Springer

119views Logical Reasoning» more CADE 1992»

Polynomial Interpretations and the Complexity of Algorithms

15 years 2 months ago

Download perso.ens-lyon.fr

The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...

Adam Cichon, Pierre Lescanne

claim paper

Read More »

click to vote

DLT
2009

91views Theoretical Computer Science» more DLT 2009»

On the Complexity of Hmelevskii's Theorem and Satisfiability of Three Unknown Equations

14 years 7 months ago

Download users.utu.fi

Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...

Aleksi Saarela

claim paper

Read More »

click to vote

CIE
2008
Springer

73views Applied Computing» more CIE 2008»

Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time

14 years 12 months ago

Download www2.mta.ac.il

Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen

claim paper

Read More »