Theoretical Computer Science

21

click to vote

TCS
2008

84views Theoretical Computer Science» more TCS 2008»

Playing with Conway's problem

13 years 11 months ago

Download hal.archives-ouvertes.fr

Emmanuel Jeandel, Nicolas Ollinger

claim paper

Read More »

34

click to vote

TCS
2008

87views Theoretical Computer Science» more TCS 2008»

Expanders and time-restricted branching programs

13 years 11 months ago

Download www.thi.informatik.uni-frankfurt.de

The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...

Stasys Jukna

claim paper

Read More »

30

click to vote

TCS
2008

126views Theoretical Computer Science» more TCS 2008»

Computations with quasiseparable polynomials and matrices

13 years 11 months ago

Download www.math.uconn.edu

In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices gener...

Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Ol...

claim paper

Read More »

41

click to vote

TCS
2008

104views Theoretical Computer Science» more TCS 2008»

Verification of qualitative Z constraints

13 years 11 months ago

Download www.lsv.ens-cachan.fr

We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...

Stéphane Demri, Régis Gascon

claim paper

Read More »

22

click to vote

TCS
2008

103views Theoretical Computer Science» more TCS 2008»

Machine semantics

13 years 11 months ago

Download www.jucs.org

Peter Hines

claim paper

Read More »

32

click to vote

TCS
2008

161views Theoretical Computer Science» more TCS 2008»

Approximate GCDs of polynomials and sparse SOS relaxations

13 years 11 months ago

Download www.mmrc.iss.ac.cn

The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...

Bin Li, Jiawang Nie, Lihong Zhi

claim paper

Read More »

27

click to vote

TCS
2008

120views Theoretical Computer Science» more TCS 2008»

CPO semantics of timed interactive actor networks

13 years 11 months ago

Download www.eecs.berkeley.edu

Xiaojun Liu, Edward A. Lee

claim paper

Read More »

33

click to vote

TCS
2008

108views Theoretical Computer Science» more TCS 2008»

Real algebraic numbers and polynomial systems of small degree

13 years 11 months ago

Download cgi.di.uoa.gr

We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...

Ioannis Z. Emiris, Elias P. Tsigaridas

claim paper

Read More »

27

click to vote

TCS
2008

91views Theoretical Computer Science» more TCS 2008»

Schur aggregation for linear systems and determinants

13 years 11 months ago

Download tr.cs.gc.cuny.edu

We apply our recent preconditioning techniques to the solution of linear systems of equations and computing determinants. We combine these techniques with the Sherman

Victor Y. Pan, D. Grady, Brian Murphy, Guoliang Qi...

claim paper

Read More »

21

click to vote

TCS
2008

85views Theoretical Computer Science» more TCS 2008»

Evolving BlenX programs to simulate the evolution of biological networks

13 years 11 months ago