Add to ORKGBounded arithmetic is a branch of mathematical logic which characterize various classes of computational complexity by fragments of arithmetical theories. On the other hand, descriptive complexity gives another logical method to characterize complexity classes. However, until recently, no ac
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded com...
: Numerical relations in logics are known to characterize, via the finite models of their sentences,...
AbstractWe define theories of bounded arithmetic, whose definable functions and relations are exactl...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
Abstract. We present an algebraic view on logic programming, related to proof theory and more specif...
A number of complexity classes, most notably ptime, have been characterised by sub-systems of linear...
AbstractThis paper gives some new logical characterizations of the class of rudimentary languages in...
We present applicative theories of words corresponding to weak, and especially logarithmic, complexi...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
AbstractA programming approach to computability and complexity theory yields more natural definition...
(eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P,...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded com...
: Numerical relations in logics are known to characterize, via the finite models of their sentences,...
AbstractWe define theories of bounded arithmetic, whose definable functions and relations are exactl...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
Exploration of the connections between computational complexity, descriptive complexity, and logic r...
This book is about two topics on the borderline between logic and complexity theory, and in particul...
Abstract. We present an algebraic view on logic programming, related to proof theory and more specif...
A number of complexity classes, most notably ptime, have been characterised by sub-systems of linear...
AbstractThis paper gives some new logical characterizations of the class of rudimentary languages in...
We present applicative theories of words corresponding to weak, and especially logarithmic, complexi...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace,...
AbstractA programming approach to computability and complexity theory yields more natural definition...
(eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P,...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded com...
: Numerical relations in logics are known to characterize, via the finite models of their sentences,...