<--- Back to Details
First PageDocument Content
Maus / In the Shadow of No Towers / Spiegelmann / Françoise Mouly / Underground comix / Bibliography of The Holocaust / Autobiographical comics / Arcade / American comic book / RAW / Comics / Art Spiegelman
Date: 2014-01-23 20:41:44
Maus
In the Shadow of No Towers
Spiegelmann
Françoise Mouly
Underground comix
Bibliography of The Holocaust
Autobiographical comics
Arcade
American comic book
RAW
Comics
Art Spiegelman

WCRL FULL LOGO 2C STACKED[removed]grey lettering

Add to Reading List

Source URL: www.vanartgallery.bc.ca

Download Document from Source Website

File Size: 1,51 MB

Share Document on Facebook

Similar Documents

Figure 1: How to get to Hello Monkey. The dinner of the ARCADE workshop will be held in the restaurant Hello Monkey (http:// hellomonkey.net/magasinsgatan). Its address is Magasinsgatan 26 (D). The most direct way to get

DocID: 1xTPy - View Document

Computational complexity theory / Conflict-driven clause learning / Drat / Exponential time hypothesis / Felgenhauer / NP-complete problems

Beyond DRAT: Challenges in Certifying UNSAT1 Bertram Felgenhauer University of Innsbruck ARCADE

DocID: 1xTHk - View Document

Computer programming / Software engineering / Computing / Lisp / ACL2 / Functional languages / J Strother Moore / Formal methods / Automated theorem proving / Common Lisp / ACL / Advanced Micro Devices

Industrial Use of ACL2: Applications, Achievements, Challenges, and Directions J Strother Moore and Marijn J.H. Heule http://www.cs.utexas.edu/users/moore/acl2 ARCADE in Gothenburg, Sweden

DocID: 1xTGw - View Document

Theoretical computer science / Logic in computer science / NP-complete problems / Constraint programming / Electronic design automation / Satisfiability modulo theories / Universal quantification / Solver

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds ARCADE Workshop August 6, 2017

DocID: 1xTvN - View Document

Mathematical logic / Mathematics / Theoretical computer science / Automated theorem proving / Logic in computer science / Methods of proof / Boolean algebra / Mathematical proofs / Proof complexity / Boolean satisfiability problem

The Potential of Interference-Based Proof Systems Marijn J.H. Heule and Benjamin Kiesl The University of Texas at Austin and Vienna University of Technology ARCADE in Gothenburg, Sweden

DocID: 1xT9b - View Document