<--- Back to Details
First PageDocument Content
Texas / Cox School of Business / Dedman College of Humanities and Sciences / Academic term / Course credit / Singapore Management University / Maguire Center for Ethics / Southern Methodist University / Dedman School of Law / Academia
Date: 2012-10-15 13:39:41
Texas
Cox School of Business
Dedman College of Humanities and Sciences
Academic term
Course credit
Singapore Management University
Maguire Center for Ethics
Southern Methodist University
Dedman School of Law
Academia

Add to Reading List

Source URL: smu.edu

Download Document from Source Website

File Size: 753,12 KB

Share Document on Facebook

Similar Documents

Cryptography / Randomized algorithms / Computational complexity theory / Mathematics / Probabilistically checkable proof / Complexity classes / Interactive proof system / IP / NP / Soundness / PCP theorem / Commitment scheme

Taking proof-based verified computation a few steps closer to practicality1 Srinath Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract. W

DocID: 1xVQw - View Document

Boolean algebra / Forcing / Theoretical computer science / Mathematics / Complete Boolean algebra / Order theory / Assertion / Mathematical logic

Cost-Aware Automatic Program Repair Roopsha Samanta1? , Oswaldo Olivo2 , and E. Allen Emerson2 1 The University of Texas at Austin and IST Austria

DocID: 1xVPw - View Document

Logic / Mathematical logic / Mathematics / Propositional calculus / Logical truth / Logic in computer science / Syntax / Automated theorem proving / Resolution / Frege system / Boolean satisfiability problem / First-order logic

The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin

DocID: 1xVI3 - View Document

Cryptography / Distributed computing architecture / Parallel computing / MapReduce / Certificate / IP / NP / Commitment scheme / PP / Computational complexity theory

Verifying computations with state Benjamin Braun, Ariel J. Feldman⋆ , Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin ⋆ University of Pennsylvania Abstract When

DocID: 1xVGQ - View Document

Artificial intelligence / Logic / Logic programming / Declarative programming / Automated reasoning / Programming paradigms / Automated theorem proving / Answer set programming / Reasoning system / Stable model semantics / Prolog / Inference

A Case for Query-driven Predicate Answer Set Programming (Position Paper) Gopal Gupta Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin Department of Computer Science The University of Texas at Dallas

DocID: 1xVE0 - View Document