A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3352967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph driven BDDs -- a new data structure for Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of free BDDs and transformed BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Revision as of 03:47, 29 June 2024

scientific article
Language Label Description Also known as
English
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
scientific article

    Statements

    A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (English)
    0 references
    0 references
    23 March 2009
    0 references
    computational complexity
    0 references
    read-once branching programs
    0 references
    nondeterminism
    0 references
    lower bounds
    0 references
    depth-restricted circuits
    0 references

    Identifiers