scientific article; zbMATH DE number 1303203
From MaRDI portal
Publication:4249726
zbMATH Open0936.03041MaRDI QIDQ4249726FDOQ4249726
Authors: William Gasarch 
Publication date: 15 May 2000
Title of this publication is not available (Why is that?)
Recommendations
- Recursive combinatorial structures: enumeration, probabilistic analysis and random generation
- The combinatorialization of linear recurrences
- A Survey of Problems in Combinatorial Number Theory
- On solutions to a general combinatorial recurrence
- On an extension of a recurrent relation from combinatorics
- Recurrent combinatorial sums and binomial-type theorems
- scientific article; zbMATH DE number 749926
- Publication:4940321
- A Selection of Problems and Results in Combinatorics
- Introduction to enumerative combinatorics
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45)
Cited In (27)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
- Reverse Mathematics and Recursive Graph Theory
- Index sets for \(\Pi^0_1\) classes
- One query reducibilities between partial information classes
- Generalizations of Opt P to the polynomial hierarchy
- The complexity of optimization problems
- Domatic partitions of computable graphs
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Forbidden substructures and combinatorial dichotomies: WQO and universality
- Primitive recursive reverse mathematics
- On the strength of König's duality theorem for infinite bipartite graphs
- Regular separability of well-structured transition systems
- Subrecursive Complexity of Identifying the Ramsey Structure of Posets
- Ramsey degrees of bipartite graphs: a primitive recursive proof
- Graph Ramsey theory and the polynomial hierarchy
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
- Undecidability of equality for codata types
- Title not available (Why is that?)
- Computing planarity in computable planar graphs
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Combinatorics in ZFC limbo
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive-combinatorial properties of subsets of the natural numbers
- Title not available (Why is that?)
- Recursively defined combinatorial functions: Extending Galton's board
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
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 Q4249726)
