Research Perspectives - Tools for Visualisation of Portfolios
EPSRC logo

EPSRC Database


Source RCUK EPSRC Data

EP/I011528/1 - Computational Counting

Research Perspectives grant details from EPSRC portfolio

http://www.researchperspectives.org/gow.grants/grant_EPI0115281.png

Professor LA Goldberg EP/I011528/1 - Computational Counting

Principal Investigator - Computer Science, University of Liverpool

Scheme

Standard Research

Research Areas

Maths of Computing Maths of Computing

Logic and Combinatorics Logic and Combinatorics

Related Grants

EP/I011935/1

EP/I012087/1

Start Date

03/2011

End Date

02/2014

Value

£327,205

Similar Grants

Automatic generation of similar EPSRC grants

Similar Topics

Topic similar to the description of this grant

Grant Description

Summary and Description of the grant

Computational complexity is typically concerned with decision problems, but this is a historical accident, arising from the origins of theoretical computer science within logic. Computing applications, on the other hand, typically involve the calculation of numerical quantities. These applications broadly fall into two types: optimisation problems, in which the goal is to maximise or (minimise) the value of a function, and counting problems, broadly interpreted, by which we mean computing sums, weighted sums, and integrals including, for example, the expectation of a random variable or the probability of an event.This project will consider all aspects of computational counting, with a particular focus on foundational questions in computational complexity (characterising the inherent difficulty of problems) and the development of algorithmic techniques. The goal of the project is to provide a better understanding of the inherent computational difficulty of counting (including approximate counting) and to provide efficient algorithms where they exist.

Structured Data / Microdata


Grant Event Details:
Name: Computational Counting - EP/I011528/1
Start Date: 2011-03-01T00:00:00+00:00
End Date: 2014-02-28T00:00:00+00:00

Organization: University of Liverpool

Description: Computational complexity is typically concerned with decision problems, but this is a historical accident, arising from the origins of theoretical computer science within logic. Computing applications, on the other hand, typically involve the calculation o ...