The following pages link to Ondřej Čepek (Q392183):
Displaying 41 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Total tightness implies Nash-solvability for three-person game forms (Q408181) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach. (Q465661) (← links)
- Discovering implied constraints in precedence graphs with alternatives (Q613781) (← links)
- Analysing DNA microarray data using Boolean techniques (Q646703) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities (Q850453) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Recognition of interval Boolean functions (Q1029585) (← links)
- Horn minimization by iterative decomposition (Q1277344) (← links)
- On perfect \(0,\pm 1\) matrices (Q1356731) (← links)
- Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
- Strong duality in Horn minimization (Q1679964) (← links)
- Separable discrete functions: recognition and sufficient conditions (Q1732758) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- A simple heuristic for knowledge base compression (Q1769110) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- Complexity issues related to propagation completeness (Q2351039) (← links)
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines (Q2387307) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Unique key Horn functions (Q2672584) (← links)
- A satisfiability formulation of problems on level graphs (Q2741531) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
- On Minimum Representations of Matched Formulas (Q2938476) (← links)
- (Q3023686) (← links)
- Minimizing the number of grab's changes in a single machine scheduling problem (Q3197848) (← links)
- Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models (Q3534663) (← links)
- A Constraint Model for State Transitions in Disjunctive Resources (Q3608443) (← links)
- Nonpreemptive open shop with restricted processing times (Q4296296) (← links)
- Note: On the two-machine no-idle flowshop problem (Q4488784) (← links)
- (Q4652816) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- (Q5294851) (← links)
- Temporal Reasoning in Nested Temporal Networks with Alternatives (Q5302722) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900285) (← links)
- Recognizing distributed approval voting forms and correspondences (Q6573343) (← links)
- A faster implementation of EQ and SE queries for switch-list representations (Q6630718) (← links)
