MainComputersComputer ScienceTheoretical › Vardi, Moshe Y.

Vardi, Moshe Y.

Edit Page
Report
Scan day: 16 February 2014 UTC
22
Virus safety - good
Description: Recent paper on the hardness of random formulas for SAT solver; bounded tree-width.
Moshe Y. Vardi's Home Page The proof, the whole proof, and nothing but the proof! Employees tend to rise to their level of incompetence. But when managers reach their level of incompetence, they are simply promoted to a higher level in a different organization, as this is the easiest way to get rid of them.
Size: 313 chars

Contact Information

Email:
Phone&Fax: 713-348-5977
Address:
Extended:

WEBSITE Info

Page title:Moshe Y. Vardi's Home Page
Keywords:database, databases, database theory, query optimization, integrity constraints, constraint satisfaction, infinitary logic, finite-model theory, finite structures, logic, fixpoint logic, second-order logic, first-order logic, automata, tree automata, program verification, specification and verification, descriptive complexity, complexity theory, multi-agent systems, modal logic, temporal logic, epistemic logic, satisfiability, knowledge theory
Description:
IP-address:128.42.128.18

WHOIS Info

NS
Name Servers: NS1.RICE.EDU 128.42.209.32 NS2.RICE.EDU 128.42.178.32
WHOIS
Date
activated: 24-Apr-1985
last updated: 17-Aug-2011
expires: 31-Jul-2014