The following pages link to Marius Zimand (Q290243):
Displaying 50 items.
- Large sets in \(\mathrm{AC}^{0}\) have many strings with low Kolmogorov complexity (Q290244) (← links)
- Relative to a random oracle, P/poly is not measurable in EXP (Q294619) (← links)
- Fundamentals of parameterized complexity (Q383833) (← links)
- A connotational theory of program structure (Q579920) (← links)
- Turing complexity of the ordinals (Q580332) (← links)
- (Q593484) (redirect page) (← links)
- Subclasses of the weakly random reals (Q609759) (← links)
- Lower bounds on the randomized communication complexity of read-once functions (Q626679) (← links)
- On the topological size of p-m-complete degrees (Q672460) (← links)
- A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law (Q672725) (← links)
- Effective category and measure in abstract complexity theory (Q672752) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- A note on a counting problem arising in percolation theory (Q685697) (← links)
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half (Q686641) (← links)
- The impact of recovery on concurrency control (Q686645) (← links)
- If not empty, NP-P is topologically large (Q688157) (← links)
- Dependence relations in computably rigid computable vector spaces (Q703839) (← links)
- A formal framework for independence with respect to transactions in the universal relation model (Q803778) (← links)
- Abstract functional dependency structures (Q803779) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Searching by elimination (Q920625) (← links)
- Exposure-resilient extractors and the derandomization of probabilistic sublinear time (Q937199) (← links)
- A class of \(\Sigma_{3}^{0}\) modular lattices embeddable as principal filters in \({\mathcal L}^*(V_\infty)\) (Q948910) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Decidability and computability of certain torsion-free abelian groups (Q976537) (← links)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Qualitative relativizations of complexity classes (Q1061119) (← links)
- Effective topological spaces. I: A definability theory (Q1061121) (← links)
- Real addition and the polynomial hierarchy (Q1063589) (← links)
- Effective topological spaces. II: A hierarchy (Q1073020) (← links)
- The undecidability of the lattice of r. e. closed subsets of an effective topological space (Q1098841) (← links)
- Effective topological spaces. III: Forcing and definability (Q1098842) (← links)
- A universal machine without change of state (Q1100903) (← links)
- Recursion theorems and effective domains (Q1102949) (← links)
- Complexity of computer algorithms (Q1104750) (← links)
- Synthesizing inductive expertise (Q1107325) (← links)
- Collapsing degrees (Q1109766) (← links)
- A satisfiability tester for non-clausal propositional calculus (Q1111774) (← links)
- Finding paths and deleting edges in directed acyclic graphs (Q1115184) (← links)
- Making data structures persistent (Q1117690) (← links)
- Formal semantics for database schemas (Q1124390) (← links)
- General iteration and unary functions (Q1182467) (← links)
- Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
- Aggregating inductive expertise on partial recursive functions (Q1187022) (← links)
- Associative-commutative reduction orderings (Q1198005) (← links)
- Note on the topological structure of random strings (Q1210302) (← links)
- Every recursive Boolean algebra is isomorphic to one with incomplete atoms (Q1210349) (← links)
- The expected additive weight of trees (Q1262116) (← links)
- Recursive query processing: The power of logic (Q1262144) (← links)
