Results 1  10
of
1,742,236
On miniaturized problems in parameterized complexity theory
, 2005
"... We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of the basic theory of miniaturizations. Using the appropriate logical formalism, we show that the miniaturization of a definable probl ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of the basic theory of miniaturizations. Using the appropriate logical formalism, we show that the miniaturization of a definable
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory
 In Proceedings of the 18th IEEE Conference on Computational Complexity
, 2003
"... We give machine characterisations and logical descriptions of a number of parameterized complexity classes. The focus of our attention is the class W[P], which we characterise as the class of all parameterized problems decidable by a nondeterministic fixedparameter tractable algorithm whose use of ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
putting these two classes into a uniform framework that we have developed in earlier work. Furthermore, we investigate the relation between alternation and space in parameterized complexity theory. In this context, we prove that the COMPACT TURING MACHINE COMPUTATION problem, shown to be hard
An isomorphism between subexponential and parameterized complexity theory
 In Proceedings of the 21st Conference on Computational Complexity
, 2006
"... Abstract. We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the socalled miniaturization mapping is a reduction preserving isomorphism between the two theories. Key words. parameterized complexity, exponential time complexity, expo ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the socalled miniaturization mapping is a reduction preserving isomorphism between the two theories. Key words. parameterized complexity, exponential time complexity
Machinebased methods in parameterized complexity theory
, 2004
"... We give machine characterizations of most parameterized complexity classes, in particular, of W[P], of the classes of the Whierarchy, and of the Ahierarchy. For example, we characterize W[P] as the class of all parameterized problems decidable by a nondeterministic fixedparameter tractable algori ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We give machine characterizations of most parameterized complexity classes, in particular, of W[P], of the classes of the Whierarchy, and of the Ahierarchy. For example, we characterize W[P] as the class of all parameterized problems decidable by a nondeterministic fixedparameter tractable
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 582 (5 self)
 Add to MetaCart
machines (in the unrelativized setting) unless there is a major breakthrough in complexity theory.
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
The architecture of complexity
 Proceedings of the American Philosophical Society
, 1962
"... A number of proposals have been advanced in recent years for the development of “general systems theory ” that, abstracting from properties peculiar to physical, biological, or social systems, would be applicable to all of them. 1 We might well feel that, while the goal is laudable, systems of such ..."
Abstract

Cited by 756 (1 self)
 Add to MetaCart
properties among diverse kinds of complex systems. The ideas that go by the name of cybernetics constitute, if not a theory, at least a point of view that has been proving fruitful over a wide range of applications. 2 It has been useful to look at the behavior of adaptive systems in terms of the concepts
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
Results 1  10
of
1,742,236