The Complexity of Linear and Stratified Context Matching Problems.
- Published in:
- Theory of Computing Systems, 2004, v. 37, n. 6, p. 717, doi. 10.1007/s00224-004-1151-9
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2004 AND VI 37 AND IP 6
Results: 5
1
2
A Dichotomy in the Complexity of Propositional Circumscription.
- Published in:
- Theory of Computing Systems, 2004, v. 37, n. 6, p. 695, doi. 10.1007/s00224-004-1152-8
- By:
- Publication type:
- Article
3
Fixed-Point Logics and Solitaire Games.
- Published in:
- Theory of Computing Systems, 2004, v. 37, n. 6, p. 675, doi. 10.1007/s00224-004-1147-5
- By:
- Publication type:
- Article
4
Finite Presentations of Infinite Structures: Automata and Interpretations.
- Published in:
- Theory of Computing Systems, 2004, v. 37, n. 6, p. 641, doi. 10.1007/s00224-004-1133-y
- By:
- Publication type:
- Article
5
Foreword.
- Published in:
- 2004
- By:
- Publication type:
- Book Chapter