<--- Back to Details
First PageDocument Content
Linear algebra / Matrix theory / Permutations / Fulkerson Prize / Computational problems / Mark Jerrum / Manindra Agrawal / Alistair Sinclair / Neeraj Kayal / Mathematics / Graph theory / Theoretical computer science
Date: 2006-11-06 15:09:00
Linear algebra
Matrix theory
Permutations
Fulkerson Prize
Computational problems
Mark Jerrum
Manindra Agrawal
Alistair Sinclair
Neeraj Kayal
Mathematics
Graph theory
Theoretical computer science

Add to Reading List

Source URL: www.ams.org

Download Document from Source Website

File Size: 32,55 KB

Share Document on Facebook

Similar Documents

Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un

DocID: 1vp2a - View Document

On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is

DocID: 1vf5u - View Document

Problems Quantifiers Computational Epistemology Identifiability General question

DocID: 1uXPk - View Document

Recreational Linguistics Series Ed.: Radev, Dragomir This series brings together, for the first time in one collection, the best English-language problems created for students competing in the Computational Linguistics O

DocID: 1uCiu - View Document

PostDoc position (f/m) (100%, 40 hours/week) in the Inverse Problems and Mathematical Imaging Group At the Johann Radon Institute for Computational and Applied Mathematics (RICAM) of the Austrian Academy of Sciences, Lin

DocID: 1unrC - View Document