<--- Back to Details
First PageDocument Content
Learning / Education / Logic / Behavior / Debating / Argumentation theory / The Skeptical Environmentalist / Argument map / Collaborative learning / Critical thinking / Arguments / Collaboration
Date: 2011-11-22 16:03:22
Learning
Education
Logic
Behavior
Debating
Argumentation theory
The Skeptical Environmentalist
Argument map
Collaborative learning
Critical thinking
Arguments
Collaboration

T. Hirashima et al. (EdsProceedings of the 19th International Conference on Computers in Education. Chiang Mai, Thailand: Asia-Pacific Society for Computers in Education Scripting Collaboration: What Affects D

Add to Reading List

Source URL: www.nectec.or.th

Download Document from Source Website

File Size: 310,20 KB

Share Document on Facebook

Similar Documents

On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK   Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

On the Size of Pairing-based Non-interactive Arguments? Jens Groth?? University College London, UK Abstract. Non-interactive arguments enable a prover to convince a verifier that a statement is true. R

DocID: 1xVKy - View Document

COSC 544 Probabilistic Proof SystemsLinear PCPs and Succinct Arguments Lecturer: Justin Thaler

COSC 544 Probabilistic Proof SystemsLinear PCPs and Succinct Arguments Lecturer: Justin Thaler

DocID: 1xVEj - View Document

Keyword and Optional Arguments in PLT Scheme Matthew Flatt Eli Barzilay  University of Utah and PLT

Keyword and Optional Arguments in PLT Scheme Matthew Flatt Eli Barzilay University of Utah and PLT

DocID: 1xVfP - View Document

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

DocID: 1xUHB - View Document

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting†∗ Jonathan Bootle1 , Andrea Cerulli1 , Pyrros Chaidos1∗∗ , Jens Groth1 , and Christophe Petit2 1

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting†∗ Jonathan Bootle1 , Andrea Cerulli1 , Pyrros Chaidos1∗∗ , Jens Groth1 , and Christophe Petit2 1

DocID: 1xUBS - View Document