Sciweavers

434 search results - page 55 / 87
» Monadic Bounded Algebras
Sort
View
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
14 years 4 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
UC
2005
Springer
14 years 3 months ago
A Computational Model for Self-assembling Flexible Tiles
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
Natasa Jonoska, Gregory L. McColm
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
14 years 3 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
ICFP
1996
ACM
14 years 2 months ago
Inductive, Coinductive, and Pointed Types
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Brian T. Howard
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 11 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm