Results 1  10
of
2,541,423
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 244 (21 self)
 Add to MetaCart
operators to second order logic results in languages capturing polynomial space and exponential time, respectively. The existence of such natural languages for each important complexity class sheds a new light on complexity theory. These languages reaffirm the importance of the complexity classes as much
Languages That Capture Complexity Classes
"... We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, weshow that a property of graphs (respectively groups, binary strings, ..."
Abstract
 Add to MetaCart
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, weshow that a property of graphs (respectively groups, binary strings,
Languages which capture complexity classes
 SIAM J. on Computing
, 1987
"... We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a graph property is in polynomial time if and only if it is ..."
Abstract

Cited by 57 (5 self)
 Add to MetaCart
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a graph property is in polynomial time if and only if it is
Logics Which Capture Complexity Classes Over the Reals
 Journal of Symbolic Logic
"... this paper we continue the work initiated in [7]. Our starting point is the absence of a meaningful class of polynomial space over the reals. Michaux proved in [10] that such a class would contain all decidable problems. There are two natural candidates to ocuppy this vacancy. The class PAR IR of se ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
structures which capture these two classes. Previously, we recall the basic concepts about IRstructures and their logics. Scattered along these sections some other complexity classes are characterized in terms of descriptive complexity. Among them, we find NC
When do Fixed Point Logics Capture Complexity Classes?
 In Proceedings 10th IEEE Symposium on Logic in Computer Science
, 1995
"... We give examples of classes of rigid structures which are of unbounded rigidity but Least fixed point (Partial fixed point) logic can express all Boolean PTIME (PSPACE) queries on these classes. This shows that definability of linear order in FO+LFP although sufficient for it to capture Boolean PTIM ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We give examples of classes of rigid structures which are of unbounded rigidity but Least fixed point (Partial fixed point) logic can express all Boolean PTIME (PSPACE) queries on these classes. This shows that definability of linear order in FO+LFP although sufficient for it to capture Boolean
Extending Stratified Datalog to Capture Complexity Classes Ranging from P to QH
 In Acta Informatica
, 2001
"... This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems that can be solved in polynomial time by a deterministic Turing machine using a constant numbe ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems that can be solved in polynomial time by a deterministic Turing machine using a constant
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
A Survey of Computer VisionBased Human Motion Capture
 Computer Vision and Image Understanding
, 2001
"... A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each ..."
Abstract

Cited by 508 (14 self)
 Add to MetaCart
A comprehensive survey of computer visionbased human motion capture literature from the past two decades is presented. The focus is on a general overview based on a taxonomy of system functionalities, broken down into four processes: initialization, tracking, pose estimation, and recognition. Each
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
The 2005 pascal visual object classes challenge
, 2006
"... Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars and peop ..."
Abstract

Cited by 633 (24 self)
 Add to MetaCart
Abstract. The PASCAL Visual Object Classes Challenge ran from February to March 2005. The goal of the challenge was to recognize objects from a number of visual object classes in realistic scenes (i.e. not presegmented objects). Four object classes were selected: motorbikes, bicycles, cars
Results 1  10
of
2,541,423