Combinatorics

Results: 2993



#Item
91Regular Expressions and Finite-State Automata  Motivation

Regular Expressions and Finite-State Automata Motivation

Add to Reading List

Source URL: cl.indiana.edu

Language: English - Date: 2016-01-11 11:30:20
92SURF-IFISC proposalsAutonomous Boolean Networks for Neuro-Inspired Information Processing Advisors: Miquel Cornelles Soriano and Ingo Fischer Digital systems are typically programmed to obtain a well-defined

SURF-IFISC proposalsAutonomous Boolean Networks for Neuro-Inspired Information Processing Advisors: Miquel Cornelles Soriano and Ingo Fischer Digital systems are typically programmed to obtain a well-defined

Add to Reading List

Source URL: ifisc.uib-csic.es

Language: English - Date: 2016-02-11 02:12:39
93Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif  Fête of Combinatorics and Computer Science

Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

Add to Reading List

Source URL: www.ifor.math.ethz.ch

Language: English - Date: 2008-11-18 08:48:31
94Reconstructing Finite Subsets of the Plane up to some Groups of Isometries Robert Scheidweiler (joint work with Jan Simon and Eberhard Triesch) In this talk, we investigate geometric and combinatorial reconstruction prob

Reconstructing Finite Subsets of the Plane up to some Groups of Isometries Robert Scheidweiler (joint work with Jan Simon and Eberhard Triesch) In this talk, we investigate geometric and combinatorial reconstruction prob

Add to Reading List

Source URL: www.mi.uni-koeln.de

Language: English - Date: 2015-11-18 10:07:13
95Worksheet on Generating Functions October 26, 2015 This worksheet is adapted from notes/exercises by Nat Thiem. 1

Worksheet on Generating Functions October 26, 2015 This worksheet is adapted from notes/exercises by Nat Thiem. 1

Add to Reading List

Source URL: math.colorado.edu

Language: English - Date: 2015-12-04 19:21:55
96Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany

Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany

Add to Reading List

Source URL: www.cits.rub.de

Language: English - Date: 2014-11-18 10:03:56
97The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡  Abstract

The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡ Abstract

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2009-04-29 21:59:48
98IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,  VOL. 26, NO. X,

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X,

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-10-21 22:17:09
99Theorem 1. If F (n) is the number of Friedman numbers in the range [1, n], then lim F (n)/n = 1. n→∞ In order to prove this claim, we begin by defining a class of integers that will be used throughout the proof.

Theorem 1. If F (n) is the number of Friedman numbers in the range [1, n], then lim F (n)/n = 1. n→∞ In order to prove this claim, we begin by defining a class of integers that will be used throughout the proof.

Add to Reading List

Source URL: www2.stetson.edu

Language: English - Date: 2010-06-20 20:24:24