Found: 9
Select item for more details and to access through your institution.
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 598, doi. 10.1007/s00224-009-9232-4
- By:
- Publication type:
- Article
A Cubic Kernel for Feedback Vertex Set and Loop Cutset.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 566, doi. 10.1007/s00224-009-9234-2
- By:
- Publication type:
- Article
Arithmetizing Classes Around $\textsf{NC}$<sup>1</sup> and $\textsf{L}$.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 499, doi. 10.1007/s00224-009-9233-3
- By:
- Publication type:
- Article
Sturmian Trees.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 443, doi. 10.1007/s00224-009-9228-0
- By:
- Publication type:
- Article
On Symmetric Signatures in Holographic Algorithms.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 398, doi. 10.1007/s00224-009-9229-z
- By:
- Publication type:
- Article
Preface of STACS 2007 Special Issue.
- Published in:
- 2010
- By:
- Publication type:
- Editorial
Small Space Representations for Metric Min-sum k-Clustering and Their Applications.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 416, doi. 10.1007/s00224-009-9235-1
- By:
- Publication type:
- Article
A Search Algorithm for Subshift Attractors of Cellular Automata.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 479, doi. 10.1007/s00224-009-9230-6
- By:
- Publication type:
- Article
Why Almost All k-Colorable Graphs Are Easy to Color.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 3, p. 523, doi. 10.1007/s00224-009-9231-5
- By:
- Publication type:
- Article