Results 11  20
of
4,128
Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics
, 1999
"... all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that new copies bear this notice and the full citation on the first page. Abstracting with credit is permitted. IIPreface You can start by put ..."
Abstract

Cited by 131 (13 self)
 Add to MetaCart
by putting the do not disturb sign. Cay, in Desert Hearts (1985). The interplay between randomness and computation is one of the most fascinating scientific phenomena uncovered in the last couple of decades. This interplay is at the heart of modern cryptography and plays a fundamental role in complexity
Solving Systems of Polynomial Equations
 AMERICAN MATHEMATICAL SOCIETY, CBMS REGIONAL CONFERENCES SERIES, NO 97
, 2002
"... One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, ..."
Abstract

Cited by 221 (14 self)
 Add to MetaCart
One of the most classical problems of mathematics is to solve systems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robotics, coding theory, optimization, mathematical biology, computer vision, game theory
Limits to Parallel Computation: PCompleteness Theory
, 1995
"... D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings of ..."
Abstract

Cited by 167 (5 self)
 Add to MetaCart
D. Kavadias, L. M. Kirousis, and P. G. Spirakis. The complexity of the reliable connectivity problem. Information Processing Letters, 39(5):245252, 13 September 1991. (135) [206] P. Kelsen. On computing a maximal independent set in a hypergraph of constant dimension in parallel. In Proceedings
Algorithms for Sequential Decision Making
, 1996
"... Sequential decision making is a fundamental task faced by any intelligent agent in an extended interaction with its environment; it is the act of answering the question "What should I do now?" In this thesis, I show how to answer this question when "now" is one of a finite set of ..."
Abstract

Cited by 212 (8 self)
 Add to MetaCart
Sequential decision making is a fundamental task faced by any intelligent agent in an extended interaction with its environment; it is the act of answering the question "What should I do now?" In this thesis, I show how to answer this question when "now" is one of a finite set of states, "do" is one of a finite set of actions, "should" is maximize a longrun measure of reward, and "I" is an automated planning or learning system (agent). In particular,
Combinatorics of Go
, 2007
"... We also study the Game Tree complexity of Go, proving an upper bound on the number of possible games of (mn)L(m,n) and a lower bound of 22 n2/2O(n) on n * n and 22n1 on 1 * n boards, in addition to exact counts for mn < = 4 and estimates up to mn = 9. We end with investigating whether one game ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We also study the Game Tree complexity of Go, proving an upper bound on the number of possible games of (mn)L(m,n) and a lower bound of 22 n2/2O(n) on n * n and 22n1 on 1 * n boards, in addition to exact counts for mn < = 4 and estimates up to mn = 9. We end with investigating whether one game
Numerical Recipes in C: The Art of Scientific Computing. Second Edition
, 1992
"... This reprinting is corrected to software version 2.10 ..."
Abstract

Cited by 177 (0 self)
 Add to MetaCart
This reprinting is corrected to software version 2.10
[DV04]. (SL5 GL4,Λ2(C5)
, 2014
"... Version 1.45 Title word crossreference (0, 1) [BBD+08, BD07, KTR08, SS06b, ..."
Abstract
 Add to MetaCart
Version 1.45 Title word crossreference (0, 1) [BBD+08, BD07, KTR08, SS06b,
Basic Analytic Combinatorics of Directed Lattice Paths
 Theoretical Computer Science
, 2001
"... This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They are then ess ..."
Abstract

Cited by 78 (12 self)
 Add to MetaCart
This paper develops a unified enumerative and asymptotic theory of directed 2dimensional lattice paths in halfplanes and quarterplanes. The lattice paths are speci ed by a finite set of rules that are both time and space homogeneous, and have a privileged direction of increase. (They
Results 11  20
of
4,128