Results 1  10
of
559
Designing Programs That Check Their Work
, 1989
"... A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output of the program on that instance is correct. This paper defines the concept of a program checker. It d ..."
Abstract

Cited by 349 (17 self)
 Add to MetaCart
. It designs program checkers for a few specific and carefully chosen problems in the class FP of functions computable in polynomial time. Problems in FP for which checkers are presented in this paper include Sorting, Matrix Rank and GCD. It also applies methods of modern cryptography, especially the idea of a
FP #P C
"... We extend one of the main results of [3], which asserts that the computation of the Euler characteristic of a semialgebraic set is complete in the counting complexity class FP #PR R. The goal is to prove a similar result over C: the computation of the Euler characteristic of an affine or projective ..."
Abstract
 Add to MetaCart
We extend one of the main results of [3], which asserts that the computation of the Euler characteristic of a semialgebraic set is complete in the counting complexity class FP #PR R. The goal is to prove a similar result over C: the computation of the Euler characteristic of an affine or projective
On the complexity of the parity argument and other inefficient proofs of existence
 JCSS
, 1994
"... We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is define ..."
Abstract

Cited by 205 (8 self)
 Add to MetaCart
We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes
Class:
"... Contract N ° 026442 DOCUMENT INFORMATION Project ref. No. Project acronym Project full title Security (distribution level) IST6thFP026442 ..."
Abstract
 Add to MetaCart
Contract N ° 026442 DOCUMENT INFORMATION Project ref. No. Project acronym Project full title Security (distribution level) IST6thFP026442
FP + OOP = Haskell
, 1992
"... The programming language Haskell adds objectoriented functionality (using a concept known as type classes) to a pure functional programming framework. This paper describes these extensions and analyzes its accomplishments as well as some problems. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The programming language Haskell adds objectoriented functionality (using a concept known as type classes) to a pure functional programming framework. This paper describes these extensions and analyzes its accomplishments as well as some problems.
FP + OOP = Haskell
"... The programming language Haskell adds objectoriented functionality (using a concept known as type classes) to a pure functional programming framework. This paper describes these extensions and analyzes its accomplishments as well as some problems. Contents 1 Introduction 1 2 Haskell overview 1 ..."
Abstract
 Add to MetaCart
The programming language Haskell adds objectoriented functionality (using a concept known as type classes) to a pure functional programming framework. This paper describes these extensions and analyzes its accomplishments as well as some problems. Contents 1 Introduction 1 2 Haskell overview 1
Motives over Fp
, 2006
"... In April, 2006, Kontsevich asked me whether the category of motives over Fp (p prime) has a fibre functor over a number field of finite degree since he had a conjecture that moreorless implied this. This article is my response. Unfortunately, since the results are generally negative or inconclusiv ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In April, 2006, Kontsevich asked me whether the category of motives over Fp (p prime) has a fibre functor over a number field of finite degree since he had a conjecture that moreorless implied this. This article is my response. Unfortunately, since the results are generally negative
An explicit sumproduct estimate in Fp
 Int. Math. Res. Notices
, 2007
"... Let Fp be the field of residue classes modulo a prime number p and let A be a nonempty subset of Fp. In this paper we give an explicit version of the sumproduct estimate of Bourgain, Katz, Tao and Bourgain, Glibichuk, Konyagin on the size of max{A+A, AA}. In particular, our result implies that ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Let Fp be the field of residue classes modulo a prime number p and let A be a nonempty subset of Fp. In this paper we give an explicit version of the sumproduct estimate of Bourgain, Katz, Tao and Bourgain, Glibichuk, Konyagin on the size of max{A+A, AA}. In particular, our result implies
CLASSIFICATION OF CONJUGACY CLASSES OF MAXIMAL ELEMENTARY ABELIAN SUBGROUPS OF GL(4, Fp).
"... Strategy: we divide elementary abelian subgroups into several classes according to the maximal Jordan form occuring in the subgroup. Any elementary abelian subgroup can be conjugated into U(4, Fp). Thus, any element has all eigenvalues equal to 1. Let Jλ be the matrix in the standard Jordan form cor ..."
Abstract
 Add to MetaCart
Strategy: we divide elementary abelian subgroups into several classes according to the maximal Jordan form occuring in the subgroup. Any elementary abelian subgroup can be conjugated into U(4, Fp). Thus, any element has all eigenvalues equal to 1. Let Jλ be the matrix in the standard Jordan form
flowFP: Fingerprinting for Flow Cytometry
, 2010
"... Background A new software package called flowFP for the analysis of flow cytometry data is introduced. The package, which is tightly integrated with other Bioconductor software for analysis of flow cytometry, provides tools to transform raw flow cytometry data into a form suitable for direct input i ..."
Abstract
 Add to MetaCart
Background A new software package called flowFP for the analysis of flow cytometry data is introduced. The package, which is tightly integrated with other Bioconductor software for analysis of flow cytometry, provides tools to transform raw flow cytometry data into a form suitable for direct input
Results 1  10
of
559