Skip to search formSkip to main contentSkip to account menu
Fast Planning Through Planning Graph Analysis
View via Publisher
Parity, circuits, and the polynomial-time hierarchy
TLDR
A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.
View on IEEE
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
TLDR
It is proved that an algorithm due to Kushilevitz and Mansour can be used to weakly learn DNF using membership queries in polynomial time, with respect to the uniform distribution on the inputs, and it is obtained that DNF expressions and decision trees are not evenWeakly learnable with any unproven assumptions.
View on ACM
Multi-party protocols
TLDR
A new model is studied, in which a collection of processes P0, ..., Pk−1 that share information about a set of integers {a0, …,ak−1}, communicate to determine a 0-1 predicate of the numbers.
View on ACM
Cryptographic Primitives Based on Hard Learning Problems
TLDR
This paper shows how to construct several cryptographic primitives based on certain assumptions on the difficulty of learning by developing further a line of thought introduced by Impagliazzo and Levin.
View via Publisher
Polynomial-time algorithms for permutation groups
TLDR
It is demonstrated that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability.
View on IEEE
On the diameter of permutation groups
We show that any group represented by generators that are cycles of bounded degree has O(n2) diameter, i.e., that the longest product of generators required to reach any permutation in the group is…
View on ACM
The expressive power of voting polynomials
TLDR
The first correct proof that, for a random oracleA, PPA is properly contained in PSPACEA is given, which allows the new result that an AC0 circuit with one majority gate cannot approximate parity to be proved.
View on ACM
Hierarchy for imbedding-distribution invariants of a graph
TLDR
An entirely different viewpoint is presented in which one seeks distributional information about the huge family of all cellular imbeddings of a graph into all closed surfaces, instead of focusing on just one imbedding or on the existence of imbedDings into just one surface.
View via Publisher
Finding a maximum-genus graph imbedding
TLDR
Topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding, which seems to be the first im Bedding algorithm for which the running time is not exponential in the genus of the imbeding surface.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License