The following pages link to Henning Schnoor (Q319802):
Displayed 31 items.
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- The complexity of the descriptiveness of Boolean circuits over different sets of gates (Q2464338) (← links)
- Noninterference with Local Policies (Q2849922) (← links)
- Active Linking Attacks (Q2946424) (← links)
- Nonuniform Boolean constraint satisfaction problems with cardinality constraint (Q2946612) (← links)
- The tractability of model checking for LTL (Q2946630) (← links)
- A Universally Defined Undecidable Unimodal Logic (Q3088054) (← links)
- Modal independence logic: (Q3133166) (← links)
- Complexity classifications for different equivalence and audit problems for Boolean circuits (Q3166221) (← links)
- Computationally Sound Analysis of a Probabilistic Contract Signing Protocol (Q3182858) (← links)
- (Q3457231) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS (Q3569272) (← links)
- Enumerating All Solutions for Constraint Satisfaction Problems (Q3590974) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q3623013) (← links)
- Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions (Q4576237) (← links)
- (Q4636302) (← links)
- (Q4910732) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means (Q4988918) (← links)
- (Q4994887) (← links)
- A Van Benthem Theorem for Modal Team Semantics (Q5351963) (← links)
- Relation Algebra and RelView Applied to Approval Voting (Q5410492) (← links)
- Generalized Modal Satisfiability (Q5449825) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492848) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- The Complexity of Generalized Satisfiability for Linear Temporal Logic (Q5758057) (← links)