<--- Back to Details
First PageDocument Content
Lance Fortnow / Computational complexity theory / ACM SIGACT / Department of Computer Science / International Colloquium on Automata /  Languages and Programming / Year of birth missing / Semi-membership / Theoretical computer science / Applied mathematics / Computer science
Date: 2014-03-06 16:52:31
Lance Fortnow
Computational complexity theory
ACM SIGACT
Department of Computer Science
International Colloquium on Automata
Languages and Programming
Year of birth missing
Semi-membership
Theoretical computer science
Applied mathematics
Computer science

Curriculum Vitae LANE A. HEMASPAANDRA1 March 6, 2014

Add to Reading List

Source URL: www.cs.rochester.edu

Download Document from Source Website

File Size: 350,30 KB

Share Document on Facebook

Similar Documents

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25

DocID: 1uCk4 - View Document

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th

DocID: 1uruF - View Document

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat

DocID: 1ulr8 - View Document

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs Marek Karpi´ nski1, , Andrzej Ruci´ nski2, , and Edyta Szyma´ nska2,  

DocID: 1tW23 - View Document

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

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

DocID: 1ruap - View Document