Results 1  10
of
6,351
Unambiguous polynomial hierarchies and exponential size
 In Proceedings of the 9th Structure in Complexity Theory Conference
, 1994
"... In the exponential case circuits of bounded depth characterize the polynomial hierachy. Using the notion of an unambiguous circuit we give a uniform framework to relate the various types of unambiguous polynomial hierarchies and to explain their differences. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In the exponential case circuits of bounded depth characterize the polynomial hierachy. Using the notion of an unambiguous circuit we give a uniform framework to relate the various types of unambiguous polynomial hierarchies and to explain their differences.
Compact vs. Exponentialsize LP Relaxations
 OPERATIONS RESEARCH LETTERS
, 2000
"... In this paper we introduce by means of examples a new technique for formulating compact (i.e. polynomialsize) LP relaxations in place of exponentialsize models requiring separation algorithms. In the same vein as a celebrated theorem by Grötschel, Lovász and Schrijver, we state the equivalence of ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In this paper we introduce by means of examples a new technique for formulating compact (i.e. polynomialsize) LP relaxations in place of exponentialsize models requiring separation algorithms. In the same vein as a celebrated theorem by Grötschel, Lovász and Schrijver, we state the equivalence
Constructing Exponentialsize Deterministic Zielonka Automata
 IN &QUOT;ICALP&QUOT;, VOL. LNCS 4052
, 2006
"... The wellknown algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the wellk ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka’s algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3526 (46 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results
Monotone multilinear boolean circuits for bipartite perfect matching require exponential size
 FSTTCS. VOLUME 3328 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... A monotone boolean circuit is said to be multilinear if for any AND gate in the circuit, the minimal representation of the two input functions to the gate do not have any variable in common. We show that monotone multilinear boolean circuits for bipartite perfect matching require exponential size. I ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A monotone boolean circuit is said to be multilinear if for any AND gate in the circuit, the minimal representation of the two input functions to the gate do not have any variable in common. We show that monotone multilinear boolean circuits for bipartite perfect matching require exponential size
Operations Research Letters Compact vs. exponentialsize LP relaxations
, 2002
"... Abstract In this paper, we illustrate by means of examples a technique for formulating compact (i.e. polynomialsize) linear programming relaxations in place of exponentialsize models requiring separation algorithms. In the same vein as a celebrated theorem by Gr otschel, LovÃ asz and Schrijver, w ..."
Abstract
 Add to MetaCart
Abstract In this paper, we illustrate by means of examples a technique for formulating compact (i.e. polynomialsize) linear programming relaxations in place of exponentialsize models requiring separation algorithms. In the same vein as a celebrated theorem by Gr otschel, LovÃ asz and Schrijver
Text Classification using String Kernels
"... We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguo ..."
Abstract

Cited by 495 (7 self)
 Add to MetaCart
the dimension of the feature space grows exponentially with k. The paper describes how despite this fact the inner product can be e ciently evaluated by a dynamic programming technique. Experimental comparisons of the performance of the kernel compared with a standard word feature space kernel Joachims (1998
EXPLICIT CONSTRUCTION OF EXPONENTIAL SIZED FAMILIES OF kINDEPENDENT SETS
 DISCRETE MATHEMATICS
, 1986
"... Error correcting codes are used to describe explicit collections Fk of subsets of {1, 2,... n}, with IFkl> 2 ckn (ck> 0), such that for any selections A, B of kl and k 2 of members of Fk with kl + k2 = k, there are elements in all the members of A and not in the members of B. This settles a pr ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
Error correcting codes are used to describe explicit collections Fk of subsets of {1, 2,... n}, with IFkl> 2 ckn (ck> 0), such that for any selections A, B of kl and k 2 of members of Fk with kl + k2 = k, there are elements in all the members of A and not in the members of B. This settles a problem of Kleitman and Spencer and a similar problem of Kleitman, Shearer and Sturtevant.
Efficiently mining long patterns from databases
, 1998
"... We present a patternmining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real data ..."
Abstract

Cited by 457 (3 self)
 Add to MetaCart
We present a patternmining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real
Results 1  10
of
6,351