<--- Back to Details
First PageDocument Content
Combinatorial optimization / Routing algorithms / Search algorithms / A* search algorithm / Game artificial intelligence / Consensus / Polynomial interpolation / Oblivious data structure
Date: 2015-05-29 10:12:10
Combinatorial optimization
Routing algorithms
Search algorithms
A* search algorithm
Game artificial intelligence
Consensus
Polynomial interpolation
Oblivious data structure

Towards Optimal Synchronous Counting Christoph Lenzen Joel Rybicki

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Download Document from Source Website

File Size: 535,25 KB

Share Document on Facebook

Similar Documents

Using Polynomial Interpolation with 4nec2 by Duncan Cadd G0UTY It sometimes occurs that in the course of an antenna simulation in 4nec2 it is necessary to include elements with electrical characteristics which must vary

DocID: 1tFqM - View Document

MAS115: HOMEWORK 4 SAM MARSH 1. Lagrange Interpolation Lagrange interpolation is a method used to fit smooth polynomial curves to sets of points in the plane. Suppose we have n distinct points in the

DocID: 1tF9z - View Document

RC22990 (W0311-099) November 12, 2003 Mathematics IBM Research Report Error Estimates and Poisedness in Multivariate Polynomial Interpolation

DocID: 1sSxx - View Document

Mathematics / Algebra / Abstract algebra / Mathematical structures / Meromorphic functions / Commutative algebra / Digital art / Fractal / Topology / Polynomial / Riemann zeta function / Interpolation

ICMCS 2015 International Conference on Mathematics and Computer ScienceNovember 2015, Vienna, Austria

DocID: 1rjoy - View Document

Cryptography / Polynomials / Probabilistic complexity theory / IP / Commitment scheme / NP / Interactive proof system / Zero-knowledge proof / Polynomial interpolation / Polynomial / Random self-reducibility / Permutation polynomial

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document