On the Incompressibility of Monotone DNFs.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 211, doi. 10.1007/s00224-007-2013-z
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2007 AND VI 41 AND IP 2
Results: 9
1
2
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 257, doi. 10.1007/s00224-007-2034-7
- By:
- Publication type:
- Article
3
Logspace Optimization Problems and Their Approximability Properties.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 327, doi. 10.1007/s00224-007-2011-1
- By:
- Publication type:
- Article
4
Exact Algorithms for Graph Homomorphisms.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 381, doi. 10.1007/s00224-007-2007-x
- By:
- Publication type:
- Article
5
A Simple and Fast Min-Cut Algorithm.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 369, doi. 10.1007/s00224-007-2010-2
- By:
- Publication type:
- Article
6
Average-Case Non-Approximability of Optimisation Problems.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 351, doi. 10.1007/s00224-007-2012-0
- By:
- Publication type:
- Article
7
On the Power of Unambiguity in Alternating Machines.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 291, doi. 10.1007/s00224-007-2014-y
- By:
- Publication type:
- Article
8
Leftist Grammars and the Chomsky Hierarchy.
- Published in:
- Theory of Computing Systems, 2007, v. 41, n. 2, p. 233, doi. 10.1007/s00224-007-2017-8
- By:
- Publication type:
- Article
9
Preface.
- Published in:
- 2007
- By:
- Publication type:
- Editorial