<--- Back to Details
First PageDocument Content
Computational complexity theory / Logic / Complexity classes / Mathematical logic / PSPACE / FO / Second-order logic / P versus NP problem / Constraint satisfaction problem / NP / P / Constraint satisfaction
Date: 2009-11-10 10:57:12
Computational complexity theory
Logic
Complexity classes
Mathematical logic
PSPACE
FO
Second-order logic
P versus NP problem
Constraint satisfaction problem
NP
P
Constraint satisfaction

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Add to Reading List

Source URL: www.bedewell.com

Download Document from Source Website

File Size: 942,69 KB

Share Document on Facebook

Similar Documents

Description Logics  ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

DocID: 1xVOl - View Document

MLP on Wednesday, July 18th  https://easychair.org/smart-program/FLoC2018... FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

MLP on Wednesday, July 18th https://easychair.org/smart-program/FLoC2018... FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

DocID: 1xVNY - View Document

2016  Real Time Logic LLC Copyright 2016  INTRODUCTION

2016 Real Time Logic LLC Copyright 2016 INTRODUCTION

DocID: 1xVN8 - View Document

Towards a Logic for Inferring Properties of Event Streams? Sean Kauffman1 , Rajeev Joshi2 , and Klaus Havelund2 1  2

Towards a Logic for Inferring Properties of Event Streams? Sean Kauffman1 , Rajeev Joshi2 , and Klaus Havelund2 1 2

DocID: 1xVDG - View Document

Speeding Up the Constraint-Based Method in Difference Logic ⋆ Lorenzo Candeago1, Daniel Larraz2, Albert Oliveras2, Enric Rodr´ıguez-Carbonell2, and Albert Rubio2 2

Speeding Up the Constraint-Based Method in Difference Logic ⋆ Lorenzo Candeago1, Daniel Larraz2, Albert Oliveras2, Enric Rodr´ıguez-Carbonell2, and Albert Rubio2 2

DocID: 1xVBD - View Document