Results 1  10
of
169
Restricted Branching Programs and Hardware Verification
, 1995
"... Recent developments in the field of digital design and hardware verification have found great use for restricted forms of branching programs. In particular, oblivious readonce branching programs (also called "OBDD's") are central to a very common technique for verifying circuits. The ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Recent developments in the field of digital design and hardware verification have found great use for restricted forms of branching programs. In particular, oblivious readonce branching programs (also called "OBDD's") are central to a very common technique for verifying circuits
Abstract On the Power of Automata Based Proof Systems
"... One way to address the NP = co − NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof system ..."
Abstract
 Add to MetaCart
in a natural way. An interesting new proof system that we consider is based on the class of push down automata. We present an exponential lower bound for oblivious readonce branching programs which implies that the new proof system based on push down automata is, in a certain sense, more powerful than
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
Deterministic identity testing for sum of readonce oblivious arithmetic branching programs
 In 30th Conference on Computational Complexity, CCC 2015
"... A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding bl ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding
Linear Codes Are Hard for Oblivious ReadOnce Parity Branching Programs
 Information Processing Letters 69
, 1999
"... Introduction Interesting aspect of linear codes is that their characteristic functions appear to be hard for all known "readingrestricted" models of branching programs: syntactic read k times branching programs, where along every path (be it consistent or not) every variable appears at ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
at most k times, and (1; +s)branching programs, where along every consistent path at most s variables are tested more than once. Namely, it is known that for some explicit linear codes C ` f0; 1g n , their characteristic functions fC require (deterministic [6] and nondeterministic [2]) syntactic read
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
Quasipolynomialtime Identity Testing of NonCommutative and ReadOnce Oblivious Algebraic Branching Programs
, 2012
"... We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for readonce oblivious algebraic branching programs (ABPs). This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz and Shpilka [RS05]), ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We study the problem of obtaining efficient, deterministic, blackbox polynomial identity testing algorithms (PIT) for readonce oblivious algebraic branching programs (ABPs). This class has an efficient, deterministic, whitebox polynomial identity testing algorithm (due to Raz and Shpilka [RS05
On the Power of Automata Based Proof Systems
, 1999
"... One way to address the NP = co  NP question is to consider the length of proofs of tautologies in various proof systems. In this work we consider proof systems defined by appropriate classes of automata. In general, starting from a given class of automata we can define a corresponding proof syste ..."
Abstract
 Add to MetaCart
system in a natural way. An interesting new proof system that we consider is based on the class of push down automata. We present an exponential lower bound for oblivious readonce branching programs which implies that the new proof system based on push down automata is, in a certain sense, more powerful
On BPP versus NP[coNP for Ordered ReadOnce Branching Programs
, 1998
"... We investigate the relationship between probabilistic and nondeterministic complexity classes PP , BPP , NP and coNP for the ordered readonce branching programs (OBDDs) . We exhibit two explicit boolean functions q n ; r n such that: 1. q n : f0; 1g n ! f0; 1g belongs to BPP n (NP [ coNP ) in the ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
NP ) in the context of OBDDs; 2. r n : f0; 1g n ! f0; 1g belongs to PP n(BPP [NP[coNP ) in the context of OBDDs. Both of these functions are not in AC 0 . 1 Preliminaries Ordered (or oblivious) variants of readonce branching programs become an important tool in the field of digital design and hardware
Identity Testing for constantwidth, and commutative, readonce
, 2015
"... We give improved hittingsets for two special cases of Readonce Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best hittingset known for this case had cost (nw)O(logn) where n is the number of variables and w is the width of the ROABP. ..."
Abstract
 Add to MetaCart
We give improved hittingsets for two special cases of Readonce Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known variable order. The best hittingset known for this case had cost (nw)O(logn) where n is the number of variables and w is the width of the ROABP
Results 1  10
of
169