Sciweavers

Share
CSR
2009
Springer
9 years 6 months ago
On Random Ordering Constraints
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
Andreas Goerdt
CSR
2009
Springer
9 years 6 months ago
On the Complexity of Matroid Isomorphism Problems
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
CSR
2009
Springer
9 years 6 months ago
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
Maurice J. Jansen, B. V. Raghavendra Rao
CSR
2009
Springer
9 years 6 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
CSR
2009
Springer
9 years 6 months ago
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
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
CSR
2009
Springer
9 years 6 months ago
Approximability Distance in the Space of H-Colourability Problems
Tommy Färnqvist, Peter Jonsson, Johan Thapper
CSR
2009
Springer
9 years 6 months ago
The Budgeted Unique Coverage Problem and Color-Coding
Neeldhara Misra, Venkatesh Raman, Saket Saurabh, S...
books