CSR
2009
Springer
13 years 11 months ago
2009
Springer
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...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
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...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
CSR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
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...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
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 ...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
CSR
2009
Springer
13 years 11 months ago
2009
Springer
CSR
2009
Springer
13 years 11 months ago
2009
Springer
CSR
2009
Springer
13 years 11 months ago
2009
Springer