On the Complexity of Matroid Isomorphism Problem.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 246, doi. 10.1007/s00224-010-9260-0
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2011 AND VI 49 AND IP 2
Results: 14
1
2
Compressed Word Problems in HNN-extensions and Amalgamated Products.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 283, doi. 10.1007/s00224-010-9295-2
- By:
- Publication type:
- Article
3
Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 489, doi. 10.1007/s00224-010-9259-6
- By:
- Publication type:
- Article
4
New Plain-Exponential Time Classes for Graph Homomorphism.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 273, doi. 10.1007/s00224-010-9261-z
- By:
- Publication type:
- Article
5
Querying Data Sources that Export Infinite Sets of Views.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 367, doi. 10.1007/s00224-010-9293-4
- By:
- Publication type:
- Article
6
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 343, doi. 10.1007/s00224-010-9308-1
- By:
- Publication type:
- Article
7
Concatenation of Regular Languages and Descriptional Complexity.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 306, doi. 10.1007/s00224-011-9318-7
- By:
- Publication type:
- Article
8
One-Nonterminal Conjunctive Grammars over a Unary Alphabet.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 319, doi. 10.1007/s00224-011-9319-6
- By:
- Publication type:
- Article
9
Variations on Muchnik's Conditional Complexity Theorem.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 227, doi. 10.1007/s00224-011-9321-z
- By:
- Publication type:
- Article
10
Editorial.
- Published in:
- 2011
- By:
- Publication type:
- Editorial
11
Foreword.
- Published in:
- 2011
- By:
- Publication type:
- Editorial
12
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 355, doi. 10.1007/s00224-011-9324-9
- By:
- Publication type:
- Article
13
Containment of Conjunctive Queries on Annotated Relations.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 429, doi. 10.1007/s00224-011-9327-6
- By:
- Publication type:
- Article
14
Reconcilable Differences.
- Published in:
- Theory of Computing Systems, 2011, v. 49, n. 2, p. 460, doi. 10.1007/s00224-011-9323-x
- By:
- Publication type:
- Article