Stephen John Ponzio  Home/Search
Context Related
| mit.edu/publicatio...TLCSTR663.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/publications/pubs/ps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Recent developments in the field of digital design and hardware verification have found great use for restricted forms of branching programs. In particular, oblivious read-once branching programs (also called "OBDD's") are central to a very common technique for verifying circuits. These programs are useful because they are easily manipulated and compared for equivalence. However, their utility is limited because they cannot compute in polynomial size several simple functions---most notably,... (Update)
Context of citations to this paper: More
.... exist that have polynomial sized circuit representations but do not have subexponential sized OBDD representations (see [Pon95a, Pon95b] On the other hand, the translation from OBDDs to Boolean circuits is linear [Bry86] Thus, the results of [BL89, BLT92, GW83, PY86,...
.... Remark 2 except that it has been proved that f n 62 NP Gamma k Gamma OBDD [AK98] It is worth to note that as it was mentioned in [P95b] the Boolean function ACH ( Achilles Heel ) is in P Gamma BP1 n [ k2N P Gamma k Gamma OBDD. We shall show in this section that ACH is...
Cited by: More
A Lower Bound for Integer Multiplication on Randomized.. - Ablayev, Karpinski (1998) (Correct)
Lower Bounds for Randomized Branching Programs with a Big . . . - Mubarakzjanov (2000) (Correct)
Some Separation Problems on Randomized OBDDs - Karpinski, Mubarakzjanov (1998) (Correct)
Similar documents (at the sentence level):
53.9%: Restricted Branching Programs and Hardware Verification - Ponzio (1995) (Correct)
6.8%: A Lower Bound For Integer Multiplication With Read-Once Branching .. - Ponzio (1998) (Correct)
Active bibliography (related documents): More All
1.4: Complexity Theoretical Results for Randomized Branching Programs - Sauerhoff (1999) (Correct)
0.9: On Lower Bounds for Read-k-Times - Borodin, Razborov, Smolensky (Correct)
0.7: Combinatorial Methods In Boolean Function Complexity - Gal (1995) (Correct)
Similar documents based on text: More All
0.5: On The Power Of Different Types Of Restricted.. - Bollig, Sauerhoff.. (1994) (Correct)
0.4: Hierarchy Theorems For kOBDDs AND kIBDDs - Bollig, Sauerhoff, Sieling.. (1998) (Correct)
0.4: A Separation of Syntactic and Nonsyntactic (1,+k)-Branching.. - Sieling (Correct)
Related documents from co-citation: More All
7: Graph-based algorithms for boolean function manipulation - Bryant - 1986
7: On Lower Bounds for Read-k-times Branching Programs (context) - Borodin, Razborov et al. - 1993
7: A lower bound for integer multiplication with read-once branching programs - Ponzio - 1995
BibTeX entry: (Update)
S. Ponzio, Restricted branching programs and hardware verification, Technical Report, MIT/LCS-TR-633, MIT, 1995 http://citeseer.ist.psu.edu/ponzio95restricted.html More
@techreport{ ponzio95restricted,
author = "S. J. Ponzio",
title = "Restricted Branching Programs and Hardware Verification",
number = "MIT/LCS/TR-663",
pages = "77",
year = "1995",
url = "citeseer.ist.psu.edu/ponzio95restricted.html" }
Citations (may not include all citations):510 Symbolic boolean manipulation with ordered binary decision d.. - Bryant - 1992
316 Freeman and Company (context) - Garey, Johnson et al. - 1979
173 the complexity of VLSI implementations and graph representat.. - Bryant - 1991
170 Nondeterministic space is closed under complementation - Immerman - 1988
96 Learning decision trees using the Fourier spectrum - Kushilevitz, Mansour - 1991
92 Constant depth reducibility (context) - Chandra, Stockmeyer et al. - 1984
87 Verification of arithmetic functions with binary moment diag.. - Bryant, Chen - 1994
84 Mathematical Systems Theory (context) - Furst, Saxe et al. - 1984
77 Threshold circuits of bounded depth (context) - Hajnal, Maass et al. - 1993
72 Many hard examples for resolution (context) - Chv'atal, Szemer'edi - 1988
69 On span programs (context) - Karchmer, Wigderson - 1993
68 On lower bounds for read-ktimes branching programs (context) - Borodin, Razborov et al. - 1993
66 Constant-depth circuits (context) - Linial, Mansour et al. - 1989
62 Lower bounds for deterministic and nondeterministic branchin.. - Razborov - 1991
48 A complexity theory based on Boolean algebra (context) - Skyum, Valiant - 1981
47 Equivalence of free boolean graphs can be decided probabilis.. (context) - Blum, Chandra et al. - 1980
44 Communication complexity (context) - Papadimitriou, Sipser - 1982
43 Wiley-Teubner Series in Computer Science (context) - Wegener, of - 1987
41 Rounds in communication complexity revisited - Nisan, Wigderson - 1991
41 the complexity of branching programs and decision trees for .. (context) - Wegener - 1988
39 pseudorandom generators for logspace (context) - Babai, Nisan et al. - 1992
29 The complexity of the optimal variable-ordering problem of s.. - Tani, Hamaguchi et al. - 1993
29 Lower bounds of communication complexity (context) - Duris, Galil et al. - 1984
26 Boolean satisfiability and equivalence checking using genera.. (context) - Ashar, Ghosh et al. - 1991
25 Modified Branching Programs and Their Computational Power (context) - Meinel - 1989
24 New lower bounds and hierarchy results for restricted branch.. (context) - Sieling - 1995
24 Entropy of contact circuits and lower bounds on their comple.. (context) - Jukna - 1988
23 The complexity of equivalence and containment for free singl.. (context) - Fortune, Hopcroft et al. - 1978
23 Meanders and their applications in lower bounds arguments (context) - Alon, Maass - 1988
23 A new lower bound theorem for read-only-once branching progr.. (context) - Simon, Szegedy - 1993
20 Efficient data structures for boolean functions (context) - Wegener - 1994
17 Lower bounds for depth-restricted branching programs (context) - Krause - 1991
16 An exponential lower bound for one-time-only branching progr.. (context) - Zak - 1984
16 the size of binary decision diagrams representing Boolean fu.. (context) - Breitbart, Rosenkrantz - 1995
15 Polynomial threshold functions (context) - Bruck, Smolensky - 1990
15 Separating the eraser Turing machine classes L e (context) - Krause, Meinel et al. - 1991
14 A Fast Algorithm for the String-Editing Problem and Decision.. (context) - Masek - 1976
13 Efficient boolean manipulations with OBDD's can be extended .. - Gergov, Meinel - 1994
13 Lower bounds on the size of switching-and-rectifier networks.. (context) - Razborov - 1990
10 Time-space tradeoffs for integer multiplication on various t.. (context) - Gergov - 1994
10 Optimal lower bounds on the depth of polynomial-size thresho.. (context) - Wegener - 1993
9 The graph of multiplication is equivalent to counting - Buss - 1992
8 times ordered binary decision diagrams---efficient algorithm.. (context) - Bollig, Sauerhoff et al. - 1993
8 the power of different types of restricted branching program.. - Bollig, Sauerhoff et al. - 1994
8 On oblivious branching programs of linear length (context) - Krause, Waack - 1991
8 Lower bounds on the complexity of local circuits (context) - Jukna - 1986
7 The effect of null-chains on the complexity of contact schem.. (context) - Jukna - 1989
7 Lower bounds on the complexity of 1-time only branching prog.. (context) - Dunne - 1985
7 Lower bounds for branching programs computing characteristic.. (context) - Okolnishnikova - 1991
6 Search problems in the decision tree model - Lov'asz, Naor et al. - 1995
6 On different modes of communication (context) - Halstenberg, Reischuk - 1988
4 Separating complexity classes related to certain input-obliv.. (context) - Krause, Meinel et al. - 1992
4 A lower bound for readonce branching programs (context) - Babai, Hajnal et al. - 1988
3 Exponential lower bounds on the complexity of real time and .. (context) - Krause - 1988
2 Probabilistic manipulation of boolean functions using free b.. - Shen, Devadas et al. - 1995
2 Graph driven BDD's---a new data structure for boolean functi.. (context) - Sieling, Wegener - 1995
2 A neutral netlist of 10 combinational circuits (context) - Brglez, Fujiwara - 1985
2 The graph of multiplication is hard for read-k-times network.. (context) - Jukna - 1994
1 A strong separation between k and k \Gamma 1 round communica.. (context) - McGeoch - 1986
1 Separating complexity classes related to bounded alternating - Meinel, Waack - 1995
1 Soviet Mathematis Doklady (context) - Neciporuk, function - 1966
1 Schelle multiplikation grosser zahlen (context) - Schonhage, Strassen - 1971
1 Available via http://www (context) - Bollig, Wegener et al. - 1995
1 RAIRO Theoretical Computer Science (context) - Jukna, on et al. - 1994
1 Theorynet-A announcement from krischer@ti (context) - Krischer - 1994
1 IBDD's: An efficient functional representation for digital c.. (context) - Jain, Abadir et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/): More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998) (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987) (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC