Theoretical Computer Science

20

click to vote

CSR
2009
Springer

98views Theoretical Computer Science» more CSR 2009»

Formal Verification of Gate-Level Computer Systems

14 years 7 months ago

Download www-wjp.cs.uni-saarland.de

Mark A. Hillebrand, Sergey Tverdyshev

claim paper

Read More »

35

click to vote

CSR
2009
Springer

112views Theoretical Computer Science» more CSR 2009»

Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity

14 years 7 months ago

Download itcs.tsinghua.edu.cn

Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be eﬃci...

Maurice J. Jansen, B. V. Raghavendra Rao

claim paper

Read More »

40

click to vote

CSR
2009
Springer

149views Theoretical Computer Science» more CSR 2009»

Partitioning Graphs into Connected Parts

14 years 7 months ago

Download www.dur.ac.uk

The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespeciﬁed sets of vertices. We show that this problem is...

Pim van 't Hof, Daniël Paulusma, Gerhard J. W...

claim paper

Read More »

27

click to vote

CSR
2009
Springer

90views Theoretical Computer Science» more CSR 2009»

Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism

14 years 7 months ago

Download www.logic.at

We apply the semantic tool of non-deterministic matrices to characterize two important properties of canonical Gentzen-type calculi: invertibility of rules and axiom expansion. We ...

Arnon Avron, Agata Ciabattoni, Anna Zamansky

claim paper

Read More »

31

click to vote

CSR
2009
Springer

112views Theoretical Computer Science» more CSR 2009»

Approximability Distance in the Space of H-Colourability Problems

14 years 7 months ago

Download www.ida.liu.se

Tommy Färnqvist, Peter Jonsson, Johan Thapper

claim paper

Read More »

34

click to vote

CSR
2009
Springer

96views Theoretical Computer Science» more CSR 2009»

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

14 years 7 months ago

Download itcs.tsinghua.edu.cn

Maurice J. Jansen

claim paper

Read More »

38

click to vote

CSR
2009
Springer

161views Theoretical Computer Science» more CSR 2009»

The Budgeted Unique Coverage Problem and Color-Coding

14 years 7 months ago

Download www.imsc.res.in

Neeldhara Misra, Venkatesh Raman, Saket Saurabh, S...

claim paper

Read More »

25

click to vote

CSR
2009
Springer

108views Theoretical Computer Science» more CSR 2009»

Compressed Word Problems in HNN-Extensions and Amalgamated Products

14 years 7 months ago

Download www.informatik.uni-leipzig.de

Niko Haubold, Markus Lohrey

claim paper

Read More »

38

click to vote

COMPLEX
2009
Springer

231views Theoretical Computer Science» more COMPLEX 2009»

Transforming Time Series into Complex Networks

14 years 7 months ago

Download small.eie.polyu.edu.hk

We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...

Michael Small, Jie Zhang, Xiaoke Xu

claim paper

Read More »

18

click to vote

COMPLEX
2009
Springer

151views Theoretical Computer Science» more COMPLEX 2009»

Expert Mining for Solving Social Harmony Problems

14 years 7 months ago