Results 1  10
of
808
The Logic of Typed Feature Structures
, 1992
"... Feature Structures and Path Congruences. The discussion of abstract feature structures raises a historical difficulty. While I do not dispute that the full theoretical investigation of feature structures modulo renaming is correctly attributed to Moshier, the idea of representing renaming classes b ..."
Abstract

Cited by 387 (3 self)
 Add to MetaCart
Feature Structures and Path Congruences. The discussion of abstract feature structures raises a historical difficulty. While I do not dispute that the full theoretical investigation of feature structures modulo renaming is correctly attributed to Moshier, the idea of representing renaming classes
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 347 (14 self)
 Add to MetaCart
depth threshold circuits would have dramatic consequences for cryptography and number theory: in particular, such an algorithm could be used to break the RSA cryptosystem, factor Blum integers (composite numbers equivalent to 3 modulo 4), and detect quadratic residues. The results hold even if the learning
Compiler validation via equivalence modulo inputs
 In PLDI
, 2014
"... We introduce equivalence modulo inputs (EMI), a simple, widely applicable methodology for validating optimizing compilers. Our key insight is to exploit the close interplay between (1) dynamically executing a program on some test inputs and (2) statically compiling the program to work on all possibl ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We introduce equivalence modulo inputs (EMI), a simple, widely applicable methodology for validating optimizing compilers. Our key insight is to exploit the close interplay between (1) dynamically executing a program on some test inputs and (2) statically compiling the program to work on all
A Metalanguage for Programming with Bound Names Modulo Renaming
 Mathematics of Program Construction, volume 1837 of Lecture Notes in Computer Science
, 2000
"... This paper describes work in progress on the design of an MLstyle metalanguage FreshML for programming with recursively defined functions on userdefined, concrete data types whose constructors may involve variable binding. Up to operational equivalence, values of such FreshML data types can faithf ..."
Abstract

Cited by 95 (21 self)
 Add to MetaCart
This paper describes work in progress on the design of an MLstyle metalanguage FreshML for programming with recursively defined functions on userdefined, concrete data types whose constructors may involve variable binding. Up to operational equivalence, values of such FreshML data types can
On the tautological ring of a Jacobian modulo rational equivalence
 COMPOSITIO MATH
, 2007
"... We consider the Chow ring with rational coefficients of the Jacobian of a curve. Assume D is a divisor in a base point free g r d of the curve such that the canonical divisor K is a multiple of the divisor D. We find relations between tautological cycles. We give applications for curves having a de ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the Chow ring with rational coefficients of the Jacobian of a curve. Assume D is a divisor in a base point free g r d of the curve such that the canonical divisor K is a multiple of the divisor D. We find relations between tautological cycles. We give applications for curves having a degree d covering of P¹ whose ramification points are all of order d, and then for hyperelliptic curves.
An Implementation of an Efficient Algorithm for Bisimulation Equivalence
 Science of Computer Programming
, 1989
"... We present an efficient algorithm for bisimulation equivalence. Generally, bisimulation equivalence can be tested in O(mn) for a labeled transition system with m transitions and n states. In order to come up with a more efficient algorithm, we establish a relationship between bisimulation equivalenc ..."
Abstract

Cited by 113 (7 self)
 Add to MetaCart
algorithm of complexity O(m log n) to minimize labeled transition systems modulo bisimulation equivalence. This algorithm has been implemented in C and is used in Aldebaran, a tool for the verification of concurrent systems.
Null Polynomials modulo m
, 2008
"... This paper studies socalled “null polynomials modulo m”, i.e., polynomials with integer coefficients 1 that satisfy f(x) ≡ 0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m and to enumerate equivalent polynomial functions modulo ..."
Abstract
 Add to MetaCart
This paper studies socalled “null polynomials modulo m”, i.e., polynomials with integer coefficients 1 that satisfy f(x) ≡ 0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m and to enumerate equivalent polynomial functions modulo
Infinitesimal invariants for cycles modulo algebraic equivalence and 1cycles on Jacobians
"... We construct an infinitesimal invariant for cycles in a family with cohomology class in the total space lying in a given level of the Leray filtration. This infinitesimal invariant detects cycles modulo algebraic equivalence in the fibers. We apply this construction to the Ikeda family, which gives ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We construct an infinitesimal invariant for cycles in a family with cohomology class in the total space lying in a given level of the Leray filtration. This infinitesimal invariant detects cycles modulo algebraic equivalence in the fibers. We apply this construction to the Ikeda family, which gives
COUNTING EQUIVALENCE CLASSES OF VERTEX PAIRS MODULO THE DIHEDRAL ACTION ON THE ASSOCIAHEDRON
, 2012
"... This paper proves explicit formulae for the number of edges, 2sets and diagonals in the associahedron of dimension n modulo the action of the dihedral group. A generating function for the number of ksets modulo this action, as well as a formula for the cycle index, is given. A table of values is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper proves explicit formulae for the number of edges, 2sets and diagonals in the associahedron of dimension n modulo the action of the dihedral group. A generating function for the number of ksets modulo this action, as well as a formula for the cycle index, is given. A table of values
Counting Permutations Modulo PatternReplacement Equivalences for ThreeLetter Patterns
"... We study a family of equivalence relations on Sn, the group of permutations on n letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same equivalence class if one can be reached from the other through a series o ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study a family of equivalence relations on Sn, the group of permutations on n letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same equivalence class if one can be reached from the other through a series
Results 1  10
of
808