Algorithms | Sciweavers

43

AAECC
1995
Springer

137views Algorithms» more AAECC 1995»

14 years 3 months ago

Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...

Pierre-Vincent Koseleff

claim paper

Read More »

28

click to vote

AAECC
1995
Springer

86views Algorithms» more AAECC 1995»

Isometry Classes of Indecomposable Linear Codes

14 years 3 months ago

Download www.uni-graz.at

Harald Fripertinger, Adalbert Kerber

claim paper

Read More »

21

click to vote

AAECC
1995
Springer

92views Algorithms» more AAECC 1995»

Division of Entire Functions by Polynomial Ideals

14 years 3 months ago

Download lips.informatik.uni-leipzig.de

In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...

Joachim Apel

claim paper

Read More »

34

click to vote

COCO
1997
Springer

77views Algorithms» more COCO 1997»

Constraint Satisfaction: The Approximability of Minimization Problems

14 years 3 months ago

Download people.csail.mit.edu

Sanjeev Khanna, Madhu Sudan, Luca Trevisan

claim paper

Read More »

47

click to vote

OOPSLA
2000
Springer

157views Security Privacy» more OOPSLA 2000»

Scalable propagation-based call graph construction algorithms

14 years 3 months ago

Download www.cs.ucla.edu

Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...

Frank Tip, Jens Palsberg

claim paper

Read More »

37

click to vote

ASIAN
1997
Springer

81views Algorithms» more ASIAN 1997»

Verification of Pipelined Microprocessors by Comparing Memory Execution Sequences in Symbolic Simulation

14 years 3 months ago