Kernelization, proof complexity and social choice
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3672329 (Why is no real title available?)
- scientific article; zbMATH DE number 806744 (Why is no real title available?)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
- Automated search for impossibility theorems in social choice theory: ranking sets of objects
- Combinatorial algebraic topology
- Computer-aided proofs of Arrow's and other impossibility theorems
- First-order logic formalisation of Arrow's theorem
- Fundamentals of parameterized complexity
- Handbook of computational social choice
- Kernelization. Theory of parameterized preprocessing
- Kneser's conjecture, chromatic number, and homotopy
- Parameterized bounded-depth Frege is not optimal
- Parameterized proof complexity
- Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets
- Polynomial size proofs of the propositional pigeonhole principle
- Proof Complexity
- Proof Complexity and the Kneser-Lovász Theorem
- Proof of the Lovász conjecture
- Quasipolynomial size Frege proofs of Frankl's theorem on the trace of sets
- Quasipolynomial size proofs of the propositional pigeonhole principle
- Short Proofs for the Determinant Identities
- Short proofs of the Kneser-Lovász coloring principle
- Social choice and the topology of spaces of preferences
- Spines of random constraint satisfaction problems: definition and connection with computational complexity
- The complexity of proving that a graph is Ramsey
- The proof complexity of linear algebra
- The provably total NP search problems of weak second order bounded arithmetic
- The relative efficiency of propositional proof systems
- The topological equivalence of the Pareto condition and the existence of a dictator
This page was built for publication: Kernelization, proof complexity and social choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241235)
