MainComputersComputer ScienceTheoretical › Hemaspaandra, Lane

Hemaspaandra, Lane

Edit Page
Report
Scan day: 16 February 2014 UTC
62
Virus safety - good
Description: University of Rochester.
Lane A. Hemaspaandra's Home Page                                    
Size: 343 chars

Contact Information

Email:
Phone&Fax:
Address:
Extended:

WEBSITE Info

Page title:Lane A. Hemaspaandra's Home Page
Keywords:computational complexity theory, complexity theory, structural complexity theory, Lane Hemaspaandra, Lane Hemachandra, Lane A. Hemachandra, Hemaspaandra, theoretical computer science, P=NP, NP, query order, probabilistic computation, approximate computation, heuristic algorithms, algorithms from complexity, simulated annealing algorithms, fault-tolerance, data compression, cryptography, circuit theory, security, semi-feasible computation, computational politics, complexity-theoretic aspects of political science, IPL, JCI, JUCS, counting classes, downward collapse, robustness, robust computation, semi-feasible computation, P-selective sets, P-selectivity, sets of low information content, complexity theory retrospective II, home page, homepage, Edith Hemaspaandra
Description:Home page of Lane A. Hemaspaandra
IP-address:192.5.53.208

WHOIS Info

NS
Name Servers: NS1.UTD.ROCHESTER.EDU 128.151.2.1 NS2.UTD.ROCHESTER.EDU 128.151.7.6
WHOIS
Date
activated: 10-Oct-1986
last updated: 01-Aug-2013
expires: 31-Jul-2014