<--- Back to Details
First PageDocument Content
Theoretical computer science / Computational complexity theory / Mathematics / Logic in computer science / NP-complete problems / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Symposium on Discrete Algorithms / Approximation algorithm / Random walk / 2-satisfiability
Date: 2006-02-09 03:56:19
Theoretical computer science
Computational complexity theory
Mathematics
Logic in computer science
NP-complete problems
Boolean algebra
Boolean satisfiability problem
Electronic design automation
Symposium on Discrete Algorithms
Approximation algorithm
Random walk
2-satisfiability

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Add to Reading List

Source URL: students.ceid.upatras.gr

Download Document from Source Website

File Size: 139,44 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

Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008

Deontic Logic in Computer Science Leon van der Torre & Jörg Hansen ESSLIAugust 2008

DocID: 1uHka - View Document

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

αKanren A Fresh Name in Nominal Logic Programming William E. Byrd and Daniel P. Friedman Department of Computer Science, Indiana University, Bloomington, IN 47408 {webyrd,dfried}@cs.indiana.edu

DocID: 1ux8H - View Document

23rd Annual IEEE Symposium on Logic in Computer Science  Winning regions of higher-order pushdown games∗ A. Carayol†  M. Hague‡

23rd Annual IEEE Symposium on Logic in Computer Science Winning regions of higher-order pushdown games∗ A. Carayol† M. Hague‡

DocID: 1uwn4 - View Document

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

DocID: 1ud4n - View Document