<--- Back to Details
First PageDocument Content
Polynomials / Commutative algebra / Multiset / Invariant theory / IP / Computer algebra / Factorization of polynomials over a finite field and irreducibility tests / Arithmetic circuit complexity / Abstract algebra / Mathematics / Algebra
Date: 2006-11-19 16:59:50
Polynomials
Commutative algebra
Multiset
Invariant theory
IP
Computer algebra
Factorization of polynomials over a finite field and irreducibility tests
Arithmetic circuit complexity
Abstract algebra
Mathematics
Algebra

Privacy-Preserving Set Operations Lea Kissner Dawn Song

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 382,23 KB

Share Document on Facebook

Similar Documents

Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems Max Kanovich1,5 Tajana Ban Kirigin2 Vivek Nigam3 Andre Scedrov4,5 and Carolyn Talcott6 1

DocID: 1t3Ie - View Document

1 Parallel k-Means in Theory and Practice • Input: – Number of desired means k ∈ N – Set of points P ⊂ Rd (or multiset) • Output: – Set of k means C = {c1 , . . . , ck }

DocID: 1sbMi - View Document

Mathematics / Geometry / Metric geometry / Symmetry / Functions and mappings / Group theory / Conjectures / Reconstruction conjecture / Combinatorics / Multiset / Isometry

Reconstructing Finite Subsets of the Plane up to some Groups of Isometries Robert Scheidweiler (joint work with Jan Simon and Eberhard Triesch) In this talk, we investigate geometric and combinatorial reconstruction prob

DocID: 1qPcF - View Document

Mathematics / Multiset / Set / Path ordering / Theoretical computer science / Computing

Under consideration for publication in Theory and Practice of Logic Programming 1 SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers∗

DocID: 1qpLc - View Document

Computing / Multiset / Set / Associative containers / Mathematics / Software engineering

Written Examination, De ember 18th, 2013 Course noThe duration of the examination is 4 hours. Course Name: Fun tional programming

DocID: 1qfMi - View Document