Pages that link to "Item:Q5667480"
From MaRDI portal
The following pages link to The complexity of theorem-proving procedures (Q5667480):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- Backdoors to q-Horn (Q261394) (← links)
- Current trends in substructural logics (Q266641) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Term satisfiability in \(\mathrm{FL}_{\mathrm{ew}}\)-algebras (Q278739) (← links)
- Generating SAT instances with community structure (Q309919) (← links)
- Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization (Q320841) (← links)
- An approach using SAT solvers for the RCPSP with logical constraints (Q321002) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- SAT race 2015 (Q334795) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Algorithmic and structural aspects of the \(P_3\)-Radon number (Q363552) (← links)
- Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Intractability and the use of heuristics in psychological explanations (Q383037) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- A note on perfect partial elimination (Q389218) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions (Q396606) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- An analytic criterion for CSAT (Q413274) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Deciding safety properties in infinite-state pi-calculus via behavioural types (Q418155) (← links)
- Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers (Q421579) (← links)
- Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292) (← links)
- Can quantum entanglement detection schemes improve search? (Q430116) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Control: a perspective (Q463779) (← links)
- Complexity of fuzzy answer set programming under Łukasiewicz semantics (Q465597) (← links)
- Phase transitions of contingent planning problem (Q474510) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Complexity of validity for propositional dependence logics (Q515658) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem (Q543092) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- The paradox of inference and the non-triviality of analytic information (Q600847) (← links)
