scientific article; zbMATH DE number 1011685
From MaRDI portal
Publication:4337605
Recommendations
- scientific article; zbMATH DE number 1361468
- Communication complexity of multi-processor systems
- scientific article; zbMATH DE number 3970105
- Communication Complexity
- scientific article; zbMATH DE number 1361464
- scientific article; zbMATH DE number 3881884
- Communication complexity
- scientific article; zbMATH DE number 4147508
Cited in
(74)- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
- Linear lower bounds on unbounded fan-in Boolean circuits
- Lower bounds on communication complexity
- The advantages of a new approach to defining the communication complexity for VLSI
- Approximation of boolean functions by combinatorial rectangles
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- BDDs -- design, analysis, complexity, and applications.
- Algorithmic complexity of recursive and inductive algorithms
- Lower bounds for linearly transformed OBDDs and FBDDs
- Communication complexity in vertex partition whiteboard model
- On the power of randomized multicounter machines
- State complexity of some operations on binary regular languages
- Quantum branching programs and space-bounded nonuniform quantum complexity
- Quantum communication and complexity.
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
- Communication complexity method for measuring nondeterminism in finite automata
- On multi-partition communication complexity
- A survey of results on evolution-communication P systems with energy
- Descriptional complexity of regular languages
- Nondeterministic state complexity of nested word automata
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- More on deterministic and nondeterministic finite cover automata
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-k-times branching programs
- Comparing the size of NFAs with and without \(\epsilon\)-transitions
- On the OBDD complexity of the most significant bit of integer multiplication
- Transition complexity of language operations
- On the influence of the variable ordering for algorithmic learning using OBDDs
- Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
- Generalizations of the distributed Deutsch-Jozsa promise problem
- Communication complexity (for algorithm designers)
- On the Communication Complexity of Solving a Polynomial Equation
- Deterministic blow-ups of minimal NFA's
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication
- State complexity of cyclic shift
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- scientific article; zbMATH DE number 3938553 (Why is no real title available?)
- scientific article; zbMATH DE number 4068270 (Why is no real title available?)
- scientific article; zbMATH DE number 4108150 (Why is no real title available?)
- Quantum weakly nondeterministic communication complexity
- scientific article; zbMATH DE number 176553 (Why is no real title available?)
- An infinite hierarchy of languages defined by dP systems
- Communication Complexity and Lower Bounds on Multilective Computations
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs
- scientific article; zbMATH DE number 2081103 (Why is no real title available?)
- Construction of Very Hard Functions for Multiparty Communication Complexity
- scientific article; zbMATH DE number 1559553 (Why is no real title available?)
- Mixed linear layouts of planar graphs
- scientific article; zbMATH DE number 1361468 (Why is no real title available?)
- Communication Complexity
- scientific article; zbMATH DE number 1421023 (Why is no real title available?)
- Lower bounds for approximating graph parameters via communication complexity
- scientific article; zbMATH DE number 4197419 (Why is no real title available?)
- Communication Complexity
- Exact OBDD Bounds for Some Fundamental Functions
- Automata, Languages and Programming
- Larger lower bounds on the OBDD complexity of integer multiplication
- Descriptional and computational complexity of finite automata -- a survey
- Limitations of lower bound methods for deterministic nested word automata
- Probabilistic communication complexity
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- On the power of Las Vegas II: Two-way finite automata
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
- The advantages of a new approach to defining the communication complexity for VLSI
- Average circuit depth and average communication complexity
- Representing regular languages of infinite words using mod 2 multiplicity automata
- Lower bounds for the size of deterministic unranked tree automata
- Relations between communication complexity classes
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
- Lower bounds for the transition complexity of NFAs
- A note on the size of OBDDs for the graph of integer multiplication
- A quick introduction to membrane computing
- On probabilistic pushdown automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337605)
