Texts in Theoretical Computer Science An EATCS Series
A Board, GAMBCS Calude, ACDHJ Hartmanis… - 2005 - Springer
This book is an accessible introduction to complexity theory and cryptology, two closely
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …
[PDF][PDF] The complexity zoo
S Aaronson, G Kuperberg, C Granade - 2005 - cse.unl.edu
What is this? Well its a PDF version of the website www. ComplexityZoo. com typeset in
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …
The complexity class θ p 2 : Recent results and applications in AI and modal logic
The complexity class θ<Stack> <Subscript>p</Subscript> <Superscript>2</Superscript>
< Page 1 The Complexity Class OP: Recent Results and Applications in AI and Modal Logic …
< Page 1 The Complexity Class OP: Recent Results and Applications in AI and Modal Logic …
NP trees and Carnap's modal logic
G Gottlob - Journal of the ACM (JACM), 1995 - dl.acm.org
In this paper we consider problems and complexity classes definable by interdependent
queries to an oracle in NP. How the queries depend on each other is specified by a directed …
queries to an oracle in NP. How the queries depend on each other is specified by a directed …
[HTML][HTML] Choice logics and their computational properties
Abstract Qualitative Choice Logic (QCL) and Conjunctive Choice Logic (CCL) are
formalisms for preference handling, with especially QCL being well established in the field of …
formalisms for preference handling, with especially QCL being well established in the field of …
The complexity of simulating local measurements on quantum systems
An important task in quantum physics is the estimation of local quantities for ground states of
local Hamiltonians. Recently,[Ambainis, CCC 2014] defined the complexity class …
local Hamiltonians. Recently,[Ambainis, CCC 2014] defined the complexity class …
Computing functions with parallel queries to NP
B Jenner, J Torán - [1993] Proceedings of the Eigth Annual …, 1993 - ieeexplore.ieee.org
The characterizations of the class Theta/sub 2//sup p/of languages polynomial-time truth-
table reducible to sets in NP are surveyed studying the classes obtained when the …
table reducible to sets in NP are surveyed studying the classes obtained when the …
[HTML][HTML] Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
Some temporal properties of reactive systems, such as actions with duration and temporal
aggregations, which are inherently interval-based, can not be properly expressed by the …
aggregations, which are inherently interval-based, can not be properly expressed by the …
On the computational complexity of inferring evolutionary trees
HT Wareham - 1992 - research.library.mun.ca
The process of reconstructing evolutionary trees can be viewed formally as an optimization
problem. Recently, decision problems associated with the most commonly used approaches …
problem. Recently, decision problems associated with the most commonly used approaches …
Model checking: the interval way
A Molinari - arxiv preprint arxiv:1901.03880, 2019 - arxiv.org
[...] The most famous model checking (MC) techniques were developed from the late 80s,
bearing in mind the well-known" point-based" temporal logics LTL and CTL. However, while …
bearing in mind the well-known" point-based" temporal logics LTL and CTL. However, while …