The Complexity of Circumscriptive Inference in Post's Lattice.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 401, doi. 10.1007/s00224-010-9311-6
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2012 AND VI 50 AND IP 3
Results: 9
1
2
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 420, doi. 10.1007/s00224-011-9312-0
- By:
- Publication type:
- Article
3
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 433, doi. 10.1007/s00224-011-9313-z
- By:
- Publication type:
- Article
4
Trichotomies in the Complexity of Minimal Inference.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 446, doi. 10.1007/s00224-011-9320-0
- By:
- Publication type:
- Article
5
Faster Approximate String Matching for Short Patterns.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 492, doi. 10.1007/s00224-011-9322-y
- By:
- Publication type:
- Article
6
On the Correlation Between Parity and Modular Polynomials.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 516, doi. 10.1007/s00224-011-9332-9
- By:
- Publication type:
- Article
7
Irregular Total Labellings of Generalized Petersen Graphs.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 537, doi. 10.1007/s00224-011-9350-7
- By:
- Publication type:
- Article
8
The Impact of Social Ignorance on Weighted Congestion Games.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 559, doi. 10.1007/s00224-011-9355-2
- By:
- Publication type:
- Article
9
An Improved Approximation Algorithm for the Most Points Covering Problem.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 3, p. 545, doi. 10.1007/s00224-011-9353-4
- By:
- Publication type:
- Article