The following pages link to (Q4337605):
Displaying 50 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- An infinite hierarchy of languages defined by dP systems (Q418824) (← links)
- Larger lower bounds on the OBDD complexity of integer multiplication (Q553298) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance (Q844146) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- A note on the size of OBDDs for the graph of integer multiplication (Q975522) (← links)
- A quick introduction to membrane computing (Q987956) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs (Q1007589) (← links)
- The advantages of a new approach to defining the communication complexity for VLSI (Q1106661) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- BDDs -- design, analysis, complexity, and applications. (Q1428568) (← links)
- Algorithmic complexity of recursive and inductive algorithms (Q1434367) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- A survey of results on evolution-communication P systems with energy (Q1983025) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
- On the OBDD complexity of the most significant bit of integer multiplication (Q2430011) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication (Q2771493) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- On the OBDD Complexity of the Most Significant Bit of Integer Multiplication (Q3502656) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs (Q4462678) (← links)
- Construction of Very Hard Functions for Multiparty Communication Complexity (Q4494482) (← links)
- Mixed Linear Layouts of Planar Graphs (Q4625112) (← links)
- (Q5009503) (← links)
- Exact OBDD Bounds for Some Fundamental Functions (Q5448645) (← links)
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems (Q5929919) (← links)
