MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN

Source URL: cosweb1.fau.edu

• Algebra
• Mathematics
• Polynomials
• Computer algebra
• Polynomial
• General number field sieve
• Resultant
• Irreducible polynomial
• Factorization
• Polynomial greatest common divisor
• Degree of a polynomial

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

Source URL: www.pepper-project.org

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

MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXAN L(1/3) ALGORITHM FOR IDEAL CLASS GROUP AND REGULATOR COMPUTATION IN CERTAIN NUMBER FIELDS

Source URL: www.lix.polytechnique.fr

• Mathematics
• Abstract algebra
• Mathematical analysis
• Algebraic number theory
• Discriminant of an algebraic number field
• Riemann hypothesis
• Algebraic number field
• Table of stars with Bayer designations
• Computational complexity of mathematical operations

Bounded Verification with On-the-Fly Discrepancy Computation ? Chuchu Fan and Sayan Mitra {cfan10,mitras}@illinois.edu Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign.

Source URL: publish.illinois.edu

• Circuit complexity
• NC
• Mathematics
• Theoretical computer science
• Numerical software
• Lemmas
• Numerical linear algebra

Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department

Source URL: qav.comlab.ox.ac.uk

• Dynamic programming
• Markov processes
• Stochastic control
• Markov decision process
• Approximation algorithms
• Probability
• Computational complexity theory

Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ †

Source URL: www.pepper-project.org

Making Argument Systems for Outsourced Computation Practical (Sometimes) Srinath Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin Abstract This paper describes the desig

Source URL: www.pepper-project.org

• Cryptography
• Computational complexity theory
• Randomized algorithms
• Complexity classes
• Probabilistically checkable proof
• Proof theory
• IP
• NP
• NEXPTIME
• Soundness
• PCP theorem
• Commitment scheme

Four Round Secure Computation without Setup Zvika Brakerski1,? and Shai Halevi2,?? and Antigoni Polychroniadou3,? ? ? 1 Weizmann Institute of Science

Source URL: eprint.iacr.org

• Cryptography
• Public-key cryptography
• Secure multi-party computation
• Commitment scheme
• Homomorphic encryption
• Cryptographic protocol
• RSA
• Ciphertext indistinguishability
• Encryption
• Chosen-ciphertext attack
• Block cipher

Abstract The Theory and Practice of Causal Commutative Arrows Hai Liu 2011 Arrows are a popular form of abstract computation. Being more general than

Source URL: thev.net

• Software engineering
• Computing
• Computer programming
• Functional programming
• Evaluation strategy
• Programming paradigms
• Computer architecture
• Functional reactive programming
• Models of computation
• Dataflow
• Arrow
• Reactive programming

Efficient RAM and control flow in verifiable outsourced computation Riad S. Wahby⋆ , Srinath Setty† , Zuocheng Ren† , Andrew J. Blumberg† , and Michael Walfish⋆ ⋆ †

Source URL: cs.nyu.edu

• Computational complexity theory
• Theory of computation
• IP
• Proof of knowledge
• NP
• Zero-knowledge proof
• Certificate
• Theoretical computer science
• Applied mathematics