Results 1  10
of
359
Pseudorandomness for multilinear readonce algebraic branching programs
 in any order. Electronic Colloquium on Computational Complexity (ECCC
"... We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model. F ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We give deterministic blackbox polynomial identity testing algorithms for multilinear readonce oblivious algebraic branching programs (ROABPs), in nO(lg 2 n) time.1 Further, our algorithm is oblivious to the order of the variables. This is the first subexponential time algorithm for this model
Polynomial Identity Testing of ReadOnce Oblivious Algebraic Branching Programs
, 2014
"... We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz and Shp ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are readonce and oblivious. This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz
Randomization and Nondeterminsm Are Incomparable for Ordered ReadOnce Branching Programs
, 1997
"... In [3] we exhibited a simple boolean functions f n in n variables such that: 1) f n can be computed by polynomial size randomized ordered readonce branching program with one sided small error; 2) any nondeterministic ordered readonce branching program that computes f n has exponential size. In this ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In [3] we exhibited a simple boolean functions f n in n variables such that: 1) f n can be computed by polynomial size randomized ordered readonce branching program with one sided small error; 2) any nondeterministic ordered readonce branching program that computes f n has exponential size
On OBDDs for CNFs of bounded treewidth
 In KR
, 2014
"... the readonce property of branching programs and ..."
On P versus NP∩coNP for Decision Trees and ReadOnce Branching Programs
 Computational Complexity
, 1997
"... It is known that if a Boolean function f in n variables has a DNF and a CNF of size N then f also has a (deterministic) decision tree of size exp i O(log n log 2 N) j . We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministi ..."
Abstract
 Add to MetaCart
and their negations have small nondeterministic readonce branching programs. One example results from the BruenBlokhuis bound on the size of nontrivial blocking sets in projective planes: it is remarkably simple and combinatorially clear. Whereas other examples have the additional property that f is in AC 0
Free Bits, PCPs and NonApproximability  Towards Tight Results
, 1996
"... This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight nonapproximability results via consideration of measures like the "free bit complexity" and the "amortized free bit complexity" of proof systems. ..."
Abstract

Cited by 224 (39 self)
 Add to MetaCart
This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight nonapproximability results via consideration of measures like the "free bit complexity" and the "amortized free bit complexity" of proof systems.
The Maximum Clique Problem
, 1999
"... Contents 1 Introduction 2 1.1 Notations and Definitions . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Problem Formulations 4 2.1 Integer Programming Formulations . . . . . . . . . . . . . . . . . . . 5 2.2 Continuous Formulations . . . . . . . . . . . . . . . . . . . . . . . . 8 3 Computation ..."
Abstract

Cited by 195 (21 self)
 Add to MetaCart
Contents 1 Introduction 2 1.1 Notations and Definitions . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Problem Formulations 4 2.1 Integer Programming Formulations . . . . . . . . . . . . . . . . . . . 5 2.2 Continuous Formulations . . . . . . . . . . . . . . . . . . . . . . . . 8 3
Results 1  10
of
359