The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Material implication, confirmation, and counterfactuals (Q1223083) (← links)
- A Catalan triangle (Q1224098) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- Oriented matroids (Q1225060) (← links)
- On reversibility in cellular automata (Q1226471) (← links)
- Two-way nested stack automata are equivalent to two-way stack automata (Q1227452) (← links)
- Planar lattices and planar graphs (Q1227629) (← links)
- Unit measure violations in pattern recognition: Ambiguity and irrelevancy (Q1229593) (← links)
- A note on the complexity of the chromatic number problem (Q1229753) (← links)
- On ``bent'' functions (Q1230079) (← links)
- On metrizability of the free monoids (Q1230512) (← links)
- Some simplified NP-complete graph problems (Q1230637) (← links)
- Consistency in networks of relations (Q1231783) (← links)
- Probabilistic models of computer systems. I: Exact results (Q1232750) (← links)
- Riemann's hypothesis and tests for primality (Q1235011) (← links)
- Triangular imbedding of \(K_n-K_6\) (Q1235709) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- A note on a paper of G. Wegner (Q1237080) (← links)
- Further results on the Aanderaa-Rosenberg conjecture (Q1237992) (← links)
- A generalized approach to formal languages (Q1239608) (← links)
- Junctions (Q1240205) (← links)
- A generalization of Dijkstra's algorithm (Q1240557) (← links)
- The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges (Q1242929) (← links)
- LCF considered as a programming language (Q1243117) (← links)
- NP-complete decision problems for binary quadratics (Q1243130) (← links)
- Cubic graphs on \(\leq 14\) vertices (Q1243739) (← links)
- The blocking number of an affine space (Q1244233) (← links)
- Understanding the complexity of interpolation search (Q1245570) (← links)
- Matrix tree theorems (Q1245845) (← links)
- On additive partitions of integers (Q1245861) (← links)
- On the chromatic index of almost all graphs (Q1246431) (← links)
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317) (← links)
- An unusual generalized quadrangle of order sixteen (Q1247328) (← links)
- On a class of posets and the corresponding comparability graphs (Q1247984) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Proving and applying program transformations expressed with second-order patterns (Q1251063) (← links)
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks (Q1251587) (← links)
- Median graphs and Helly hypergraphs (Q1252871) (← links)
- A probabilistic remark on algebraic program testing (Q1253894) (← links)
- On branching quantifiers in English (Q1254239) (← links)
- Doubly transitive automorphism groups of block designs (Q1255087) (← links)
- Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
- The logic of paradox (Q1255485) (← links)
- The asymptotic number of labeled graphs with given degree sequences (Q1255501) (← links)
- Decomposable searching problems (Q1256856) (← links)
- Three efficient algorithms for counting problems (Q1256858) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- The number of registers required for evaluating arithmetic expressions (Q1258177) (← links)
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions (Q1258520) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
