The following pages link to (Q4298260):
Displayed 50 items.
- A probabilistic model of computing with words (Q1776375) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- The center location improvement problem under the Hamming distance (Q1781802) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- Probabilistic spatio-temporal knowledge bases: capacity constraints, count queries, and consistency checking (Q1783933) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
- On an optimal propositional proof system and the structure of easy subsets of TAUT. (Q1853507) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Tally NP sets and easy census functions. (Q1854340) (← links)
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- Complexity theory and genetics: The computational power of crossing over (Q1854479) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Functional queries in datalog (Q1862647) (← links)
- The number of 2-SAT functions (Q1870908) (← links)
- New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- A note on tolerance graph recognition (Q1887065) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies (Q1923638) (← links)
- Inapproximability of the Tutte polynomial of a planar graph (Q1926110) (← links)
- Minimum cost partitions of trees with supply and demand (Q1934311) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Route-enabling graph orientation problems (Q1939659) (← links)
- On the complexity of tree pattern containment with arithmetic comparisons (Q1944129) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Formal verification based on Boolean expression diagrams (Q1954165) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- On computation of Boolean involutive bases (Q1956959) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- On structured output training: hard cases and an efficient alternative (Q1959508) (← links)
- On logics with two variables (Q1960419) (← links)
- Hard sets are hard to find (Q1961379) (← links)
- Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
- The maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges (Q1977262) (← links)
- Probabilistic verification of proofs in calculuses (Q1977920) (← links)
- A natural explanation for the minimum entropy production principle (Q1979842) (← links)
- Simulating counting oracles with cooperation (Q1982984) (← links)
- Seeking computational efficiency boundaries: the Păun's conjecture (Q1982986) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem (Q2003990) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)