Search Sciweavers | Sciweavers

1204 search results - page 24 / 241

» Termination of Polynomial Programs

click to vote

DAGSTUHL
2007

116views Software Engineering» more DAGSTUHL 2007»

Implementing RPO and POLO using SAT

14 years 11 days ago

Download drops.dagstuhl.de

Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...

Peter Schneider-Kamp, Carsten Fuhs, René Th...

claim paper

Read More »

click to vote

ICALP
2010
Springer

102views Programming Languages» more ICALP 2010»

Exponential Time Complexity of the Permanent and the Tutte Polynomial

14 years 3 months ago

Download www2.informatik.hu-berlin.de

Holger Dell, Thore Husfeldt, Martin Wahlen

claim paper

Read More »

click to vote

ICALP
2010
Springer

97views Programming Languages» more ICALP 2010»

On LR(k)-Parsers of Polynomial Size

14 years 3 months ago

Download theory.cs.uni-bonn.de

Norbert Blum

claim paper

Read More »

click to vote

ICALP
1999
Springer

74views Programming Languages» more ICALP 1999»

Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)

14 years 3 months ago

Download www.math.uconn.edu

Vadim Olshevsky, Victor Y. Pan

claim paper

Read More »

click to vote

ICALP
1995
Springer

71views Programming Languages» more ICALP 1995»

Polynomial Closure and Unambiguous Product

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers