Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Boolean). Showing records 1 – 30 of 411 total matches.

[1] [2] [3] [4] [5] … [14]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Texas A&M University

1. Varghese, Rajani Rajan. Boolean Network Model of Hypoxia Stress Response Pathway.

Degree: MS, Electrical Engineering, 2014, Texas A&M University

 Hypoxic stress is a consequence of the decrease in the oxygen reaching the tissues of the body. The coupling of energy with oxygen makes low… (more)

Subjects/Keywords: hypoxia; Boolean network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Varghese, R. R. (2014). Boolean Network Model of Hypoxia Stress Response Pathway. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152506

Chicago Manual of Style (16th Edition):

Varghese, Rajani Rajan. “Boolean Network Model of Hypoxia Stress Response Pathway.” 2014. Masters Thesis, Texas A&M University. Accessed August 15, 2020. http://hdl.handle.net/1969.1/152506.

MLA Handbook (7th Edition):

Varghese, Rajani Rajan. “Boolean Network Model of Hypoxia Stress Response Pathway.” 2014. Web. 15 Aug 2020.

Vancouver:

Varghese RR. Boolean Network Model of Hypoxia Stress Response Pathway. [Internet] [Masters thesis]. Texas A&M University; 2014. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1969.1/152506.

Council of Science Editors:

Varghese RR. Boolean Network Model of Hypoxia Stress Response Pathway. [Masters Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152506


Queens University

2. Stevenson, Andrew. Source Transformation with Boolean Grammars .

Degree: Computing, 2015, Queens University

 We propose an enhancement to current parsing and transformation systems by leveraging the expressive power of Boolean grammars, a generalization of context-free grammars that adds… (more)

Subjects/Keywords: Parsing ; Boolean grammar

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stevenson, A. (2015). Source Transformation with Boolean Grammars . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/13744

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Stevenson, Andrew. “Source Transformation with Boolean Grammars .” 2015. Thesis, Queens University. Accessed August 15, 2020. http://hdl.handle.net/1974/13744.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Stevenson, Andrew. “Source Transformation with Boolean Grammars .” 2015. Web. 15 Aug 2020.

Vancouver:

Stevenson A. Source Transformation with Boolean Grammars . [Internet] [Thesis]. Queens University; 2015. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1974/13744.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stevenson A. Source Transformation with Boolean Grammars . [Thesis]. Queens University; 2015. Available from: http://hdl.handle.net/1974/13744

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Portland State University

3. Schimanski, Nichole Louise. Orthomorphisms of Boolean Groups.

Degree: PhD, Mathematics and Statistics, 2016, Portland State University

  An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x)… (more)

Subjects/Keywords: Boolean algebra; Permutation groups; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schimanski, N. L. (2016). Orthomorphisms of Boolean Groups. (Doctoral Dissertation). Portland State University. Retrieved from http://pdxscholar.library.pdx.edu/open_access_etds/3100

Chicago Manual of Style (16th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Doctoral Dissertation, Portland State University. Accessed August 15, 2020. http://pdxscholar.library.pdx.edu/open_access_etds/3100.

MLA Handbook (7th Edition):

Schimanski, Nichole Louise. “Orthomorphisms of Boolean Groups.” 2016. Web. 15 Aug 2020.

Vancouver:

Schimanski NL. Orthomorphisms of Boolean Groups. [Internet] [Doctoral dissertation]. Portland State University; 2016. [cited 2020 Aug 15]. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100.

Council of Science Editors:

Schimanski NL. Orthomorphisms of Boolean Groups. [Doctoral Dissertation]. Portland State University; 2016. Available from: http://pdxscholar.library.pdx.edu/open_access_etds/3100


Oregon State University

4. Driessel, Kenneth Richard. Circuit algebras and some of their properties.

Degree: MS, Mathematics, 1965, Oregon State University

 It is well known that two-terminal switching circuits may be represented by boolean formulas. Thus the study of certain switching circuit problems leads to the… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Driessel, K. R. (1965). Circuit algebras and some of their properties. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/48145

Chicago Manual of Style (16th Edition):

Driessel, Kenneth Richard. “Circuit algebras and some of their properties.” 1965. Masters Thesis, Oregon State University. Accessed August 15, 2020. http://hdl.handle.net/1957/48145.

MLA Handbook (7th Edition):

Driessel, Kenneth Richard. “Circuit algebras and some of their properties.” 1965. Web. 15 Aug 2020.

Vancouver:

Driessel KR. Circuit algebras and some of their properties. [Internet] [Masters thesis]. Oregon State University; 1965. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1957/48145.

Council of Science Editors:

Driessel KR. Circuit algebras and some of their properties. [Masters Thesis]. Oregon State University; 1965. Available from: http://hdl.handle.net/1957/48145


Oregon State University

5. Dixon, Oren Wesley. On the simplification of Boolean polynomials.

Degree: MS, Mathematics, 1962, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dixon, O. W. (1962). On the simplification of Boolean polynomials. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/49017

Chicago Manual of Style (16th Edition):

Dixon, Oren Wesley. “On the simplification of Boolean polynomials.” 1962. Masters Thesis, Oregon State University. Accessed August 15, 2020. http://hdl.handle.net/1957/49017.

MLA Handbook (7th Edition):

Dixon, Oren Wesley. “On the simplification of Boolean polynomials.” 1962. Web. 15 Aug 2020.

Vancouver:

Dixon OW. On the simplification of Boolean polynomials. [Internet] [Masters thesis]. Oregon State University; 1962. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1957/49017.

Council of Science Editors:

Dixon OW. On the simplification of Boolean polynomials. [Masters Thesis]. Oregon State University; 1962. Available from: http://hdl.handle.net/1957/49017


Oregon State University

6. Toms, Ralph Marvin. On systems of Boolean equations.

Degree: MS, Mathematics, 1961, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Toms, R. M. (1961). On systems of Boolean equations. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/50066

Chicago Manual of Style (16th Edition):

Toms, Ralph Marvin. “On systems of Boolean equations.” 1961. Masters Thesis, Oregon State University. Accessed August 15, 2020. http://hdl.handle.net/1957/50066.

MLA Handbook (7th Edition):

Toms, Ralph Marvin. “On systems of Boolean equations.” 1961. Web. 15 Aug 2020.

Vancouver:

Toms RM. On systems of Boolean equations. [Internet] [Masters thesis]. Oregon State University; 1961. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1957/50066.

Council of Science Editors:

Toms RM. On systems of Boolean equations. [Masters Thesis]. Oregon State University; 1961. Available from: http://hdl.handle.net/1957/50066


Oregon State University

7. Laxdal, Albert Lee. A mechanization of Quine's canonical form.

Degree: MS, Mathematics, 1959, Oregon State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Laxdal, A. L. (1959). A mechanization of Quine's canonical form. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/50177

Chicago Manual of Style (16th Edition):

Laxdal, Albert Lee. “A mechanization of Quine's canonical form.” 1959. Masters Thesis, Oregon State University. Accessed August 15, 2020. http://hdl.handle.net/1957/50177.

MLA Handbook (7th Edition):

Laxdal, Albert Lee. “A mechanization of Quine's canonical form.” 1959. Web. 15 Aug 2020.

Vancouver:

Laxdal AL. A mechanization of Quine's canonical form. [Internet] [Masters thesis]. Oregon State University; 1959. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1957/50177.

Council of Science Editors:

Laxdal AL. A mechanization of Quine's canonical form. [Masters Thesis]. Oregon State University; 1959. Available from: http://hdl.handle.net/1957/50177


Virginia Tech

8. Kadelka, Claus Thomas. Robustness Analysis of Gene Regulatory Networks.

Degree: PhD, Mathematics, 2015, Virginia Tech

 Cells generally manage to maintain stable phenotypes in the face of widely varying environmental conditions. This fact is particularly surprising since the key step of… (more)

Subjects/Keywords: Boolean network; gene regulation; stability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kadelka, C. T. (2015). Robustness Analysis of Gene Regulatory Networks. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/73302

Chicago Manual of Style (16th Edition):

Kadelka, Claus Thomas. “Robustness Analysis of Gene Regulatory Networks.” 2015. Doctoral Dissertation, Virginia Tech. Accessed August 15, 2020. http://hdl.handle.net/10919/73302.

MLA Handbook (7th Edition):

Kadelka, Claus Thomas. “Robustness Analysis of Gene Regulatory Networks.” 2015. Web. 15 Aug 2020.

Vancouver:

Kadelka CT. Robustness Analysis of Gene Regulatory Networks. [Internet] [Doctoral dissertation]. Virginia Tech; 2015. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10919/73302.

Council of Science Editors:

Kadelka CT. Robustness Analysis of Gene Regulatory Networks. [Doctoral Dissertation]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/73302


Rutgers University

9. Gruber, Aritanan G., 1974-. Algorithmic and complexity results for boolean and pseudo-boolean functions.

Degree: PhD, Operations Research, 2015, Rutgers University

This dissertation presents our contributions to two problems. In the first problem, we study the hardness of approximation of clause minimum and literal minimum representations… (more)

Subjects/Keywords: Algebra, Boolean; Algebraic functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gruber, Aritanan G., 1. (2015). Algorithmic and complexity results for boolean and pseudo-boolean functions. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46349/

Chicago Manual of Style (16th Edition):

Gruber, Aritanan G., 1974-. “Algorithmic and complexity results for boolean and pseudo-boolean functions.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 15, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46349/.

MLA Handbook (7th Edition):

Gruber, Aritanan G., 1974-. “Algorithmic and complexity results for boolean and pseudo-boolean functions.” 2015. Web. 15 Aug 2020.

Vancouver:

Gruber, Aritanan G. 1. Algorithmic and complexity results for boolean and pseudo-boolean functions. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 15]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46349/.

Council of Science Editors:

Gruber, Aritanan G. 1. Algorithmic and complexity results for boolean and pseudo-boolean functions. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46349/


Michigan State University

10. Zhang, Ping. Subposets of the boolean algebra.

Degree: PhD, Department of Mathematics, 1994, Michigan State University

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, P. (1994). Subposets of the boolean algebra. (Doctoral Dissertation). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:29845

Chicago Manual of Style (16th Edition):

Zhang, Ping. “Subposets of the boolean algebra.” 1994. Doctoral Dissertation, Michigan State University. Accessed August 15, 2020. http://etd.lib.msu.edu/islandora/object/etd:29845.

MLA Handbook (7th Edition):

Zhang, Ping. “Subposets of the boolean algebra.” 1994. Web. 15 Aug 2020.

Vancouver:

Zhang P. Subposets of the boolean algebra. [Internet] [Doctoral dissertation]. Michigan State University; 1994. [cited 2020 Aug 15]. Available from: http://etd.lib.msu.edu/islandora/object/etd:29845.

Council of Science Editors:

Zhang P. Subposets of the boolean algebra. [Doctoral Dissertation]. Michigan State University; 1994. Available from: http://etd.lib.msu.edu/islandora/object/etd:29845


University of Victoria

11. Lui, Patrick Kam. Simplified theory of Boolean functions.

Degree: Department of Computer Science, 2018, University of Victoria

 A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This… (more)

Subjects/Keywords: Computer science; Mathematics; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lui, P. K. (2018). Simplified theory of Boolean functions. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Thesis, University of Victoria. Accessed August 15, 2020. https://dspace.library.uvic.ca//handle/1828/9500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Web. 15 Aug 2020.

Vancouver:

Lui PK. Simplified theory of Boolean functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Aug 15]. Available from: https://dspace.library.uvic.ca//handle/1828/9500.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lui PK. Simplified theory of Boolean functions. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9500

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Arizona

12. Mobley, Charles Lee, 1920-. Matric representation of Boolean algebras .

Degree: 1947, University of Arizona

Subjects/Keywords: Algebra; Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mobley, Charles Lee, 1. (1947). Matric representation of Boolean algebras . (Masters Thesis). University of Arizona. Retrieved from http://hdl.handle.net/10150/319175

Chicago Manual of Style (16th Edition):

Mobley, Charles Lee, 1920-. “Matric representation of Boolean algebras .” 1947. Masters Thesis, University of Arizona. Accessed August 15, 2020. http://hdl.handle.net/10150/319175.

MLA Handbook (7th Edition):

Mobley, Charles Lee, 1920-. “Matric representation of Boolean algebras .” 1947. Web. 15 Aug 2020.

Vancouver:

Mobley, Charles Lee 1. Matric representation of Boolean algebras . [Internet] [Masters thesis]. University of Arizona; 1947. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10150/319175.

Council of Science Editors:

Mobley, Charles Lee 1. Matric representation of Boolean algebras . [Masters Thesis]. University of Arizona; 1947. Available from: http://hdl.handle.net/10150/319175


University of British Columbia

13. Klug, Anthony C. Some theory of Boolean valued models .

Degree: 1974, University of British Columbia

Boolean valued structures are defined and some of their properties are studied. Completeness and compactness theorems are proved and Lowenheim-Skolem theorems are looked at. It… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Klug, A. C. (1974). Some theory of Boolean valued models . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/18793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Klug, Anthony C. “Some theory of Boolean valued models .” 1974. Thesis, University of British Columbia. Accessed August 15, 2020. http://hdl.handle.net/2429/18793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Klug, Anthony C. “Some theory of Boolean valued models .” 1974. Web. 15 Aug 2020.

Vancouver:

Klug AC. Some theory of Boolean valued models . [Internet] [Thesis]. University of British Columbia; 1974. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2429/18793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klug AC. Some theory of Boolean valued models . [Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/18793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of British Columbia

14. Galay, Theodore Alexander. Radical classes of Boolean algebras .

Degree: 1974, University of British Columbia

 This thesis obtains information about Boolean algebras by means of the radical concept. One group of results revolves about the concept, theorems, and constructions of… (more)

Subjects/Keywords: Algebra; Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Galay, T. A. (1974). Radical classes of Boolean algebras . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/19509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Galay, Theodore Alexander. “Radical classes of Boolean algebras .” 1974. Thesis, University of British Columbia. Accessed August 15, 2020. http://hdl.handle.net/2429/19509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Galay, Theodore Alexander. “Radical classes of Boolean algebras .” 1974. Web. 15 Aug 2020.

Vancouver:

Galay TA. Radical classes of Boolean algebras . [Internet] [Thesis]. University of British Columbia; 1974. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2429/19509.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Galay TA. Radical classes of Boolean algebras . [Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/19509

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Harvill, John Bowman. Elements of Boolean Algebra Theory.

Degree: 1957, North Texas State College

 The primary purpose of this paper is to state a set of postulates for Boolean algebra and show the characteristic theorems derivable from them, and… (more)

Subjects/Keywords: boolean algebra; Algebra, Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harvill, J. B. (1957). Elements of Boolean Algebra Theory. (Thesis). North Texas State College. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc107933/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Harvill, John Bowman. “Elements of Boolean Algebra Theory.” 1957. Thesis, North Texas State College. Accessed August 15, 2020. https://digital.library.unt.edu/ark:/67531/metadc107933/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Harvill, John Bowman. “Elements of Boolean Algebra Theory.” 1957. Web. 15 Aug 2020.

Vancouver:

Harvill JB. Elements of Boolean Algebra Theory. [Internet] [Thesis]. North Texas State College; 1957. [cited 2020 Aug 15]. Available from: https://digital.library.unt.edu/ark:/67531/metadc107933/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harvill JB. Elements of Boolean Algebra Theory. [Thesis]. North Texas State College; 1957. Available from: https://digital.library.unt.edu/ark:/67531/metadc107933/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. -6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.

Degree: 2018, Texas A&M International University

 Heindorf and Shapiro studied commuting pairs of Boolean subalgebras and showed that Boolean subalgebra pairs that commute retain their commutativity property after taking the exponential… (more)

Subjects/Keywords: three-way commuting; subalgebra triples; boolean subalgebras; commuting property of boolean subalgebra triples; commuting property of boolean algebras; commuting boolean subalgebras; weakly commuting boolean subalgebra n-tuples; commuting boolean subalgebra n-tuples; exponential functor; Vietoris hyperspace; Stone dual; Stone Representation Theorem; Fields; destroying the commutativity property of finite boolean subalgebra triples; four atom boolean algebra; three atom boolean algebra; atomic boolean algebras; inheriting properties of boolean algebras; atom-wise inheritance of boolean algebra properties; inheriting the commuting property of boolean algebras; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-6678-5678. (2018). Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. (Thesis). Texas A&M International University. Retrieved from http://hdl.handle.net/2152.4/97

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-6678-5678. “Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.” 2018. Thesis, Texas A&M International University. Accessed August 15, 2020. http://hdl.handle.net/2152.4/97.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-6678-5678. “Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples.” 2018. Web. 15 Aug 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. [Internet] [Thesis]. Texas A&M International University; 2018. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/2152.4/97.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-6678-5678. Breaking the Weak Commutative Property of Finite Boolean Subalgebra Triples. [Thesis]. Texas A&M International University; 2018. Available from: http://hdl.handle.net/2152.4/97

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


Ohio University

17. Zhu, Guangwen. Structural Stability Conditions for Boolean Delay Equations.

Degree: MS, Mathematics (Arts and Sciences), 2008, Ohio University

Boolean delay equations (BDEs) are a potential tool for modeling physical systems with threshold behavior and nonlinear feedbacks. BDEs are evolution equations for discrete… (more)

Subjects/Keywords: Bioinformatics; Boolean Delay Equations; Matlab; BDEs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhu, G. (2008). Structural Stability Conditions for Boolean Delay Equations. (Masters Thesis). Ohio University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1213731021

Chicago Manual of Style (16th Edition):

Zhu, Guangwen. “Structural Stability Conditions for Boolean Delay Equations.” 2008. Masters Thesis, Ohio University. Accessed August 15, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1213731021.

MLA Handbook (7th Edition):

Zhu, Guangwen. “Structural Stability Conditions for Boolean Delay Equations.” 2008. Web. 15 Aug 2020.

Vancouver:

Zhu G. Structural Stability Conditions for Boolean Delay Equations. [Internet] [Masters thesis]. Ohio University; 2008. [cited 2020 Aug 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1213731021.

Council of Science Editors:

Zhu G. Structural Stability Conditions for Boolean Delay Equations. [Masters Thesis]. Ohio University; 2008. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1213731021


University of Waterloo

18. Levi, Amit. On Tolerant Testing and Tolerant Junta Testing.

Degree: 2020, University of Waterloo

 Over the past few decades property testing has became an active field of study in theoretical computer science. The algorithmic task is to determine, given… (more)

Subjects/Keywords: juntas; Property testing; Tolerant testing; Boolean functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Levi, A. (2020). On Tolerant Testing and Tolerant Junta Testing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16050

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Levi, Amit. “On Tolerant Testing and Tolerant Junta Testing.” 2020. Thesis, University of Waterloo. Accessed August 15, 2020. http://hdl.handle.net/10012/16050.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Levi, Amit. “On Tolerant Testing and Tolerant Junta Testing.” 2020. Web. 15 Aug 2020.

Vancouver:

Levi A. On Tolerant Testing and Tolerant Junta Testing. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/10012/16050.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Levi A. On Tolerant Testing and Tolerant Junta Testing. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16050

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


McMaster University

19. Thong, Jason. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.

Degree: PhD, 2014, McMaster University

The Boolean satisfiability (SAT) problem is central to many applications involving the verification and optimization of digital systems. These combinatorial problems are typically solved by… (more)

Subjects/Keywords: FPGA; heterogeneous computing; Boolean satisfiability; hardware acceleration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Thong, J. (2014). FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/16419

Chicago Manual of Style (16th Edition):

Thong, Jason. “FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.” 2014. Doctoral Dissertation, McMaster University. Accessed August 15, 2020. http://hdl.handle.net/11375/16419.

MLA Handbook (7th Edition):

Thong, Jason. “FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing.” 2014. Web. 15 Aug 2020.

Vancouver:

Thong J. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. [Internet] [Doctoral dissertation]. McMaster University; 2014. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11375/16419.

Council of Science Editors:

Thong J. FPGA Acceleration of Decision-Based Problems using Heterogeneous Computing. [Doctoral Dissertation]. McMaster University; 2014. Available from: http://hdl.handle.net/11375/16419


University of Rochester

20. Conner, Ryan Patrick. Investigating PSGL-1 Dysregulation During HIV-1 Infection.

Degree: PhD, 2017, University of Rochester

 The Human Immunodeficiency Virus (HIV) infects approximately 3 million people worldwide. While combined AntiRetroviral Therapy (cART) has led to a significant decrease in mortality, it… (more)

Subjects/Keywords: HIV; Monocyte; Boolean network; PSGL-1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Conner, R. P. (2017). Investigating PSGL-1 Dysregulation During HIV-1 Infection. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/32908

Chicago Manual of Style (16th Edition):

Conner, Ryan Patrick. “Investigating PSGL-1 Dysregulation During HIV-1 Infection.” 2017. Doctoral Dissertation, University of Rochester. Accessed August 15, 2020. http://hdl.handle.net/1802/32908.

MLA Handbook (7th Edition):

Conner, Ryan Patrick. “Investigating PSGL-1 Dysregulation During HIV-1 Infection.” 2017. Web. 15 Aug 2020.

Vancouver:

Conner RP. Investigating PSGL-1 Dysregulation During HIV-1 Infection. [Internet] [Doctoral dissertation]. University of Rochester; 2017. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1802/32908.

Council of Science Editors:

Conner RP. Investigating PSGL-1 Dysregulation During HIV-1 Infection. [Doctoral Dissertation]. University of Rochester; 2017. Available from: http://hdl.handle.net/1802/32908


University of Manchester

21. Fenner, Peter John. Some algorithmic problems in monoids of Boolean matrices.

Degree: 2018, University of Manchester

 A Boolean matrix is a matrix with elements from the Boolean semiring ({0, 1}, +, x), where the addition and multiplication are as usual with… (more)

Subjects/Keywords: semigroup theory; computational complexity; Boolean matrices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fenner, P. J. (2018). Some algorithmic problems in monoids of Boolean matrices. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995

Chicago Manual of Style (16th Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Doctoral Dissertation, University of Manchester. Accessed August 15, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

MLA Handbook (7th Edition):

Fenner, Peter John. “Some algorithmic problems in monoids of Boolean matrices.” 2018. Web. 15 Aug 2020.

Vancouver:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Internet] [Doctoral dissertation]. University of Manchester; 2018. [cited 2020 Aug 15]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995.

Council of Science Editors:

Fenner PJ. Some algorithmic problems in monoids of Boolean matrices. [Doctoral Dissertation]. University of Manchester; 2018. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:315995


Montana Tech

22. Walsh, Edward T. Boolean algebras and their topological duals.

Degree: MA, 1966, Montana Tech

Subjects/Keywords: Algebra; Boolean.; Topology.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walsh, E. T. (1966). Boolean algebras and their topological duals. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/8035

Chicago Manual of Style (16th Edition):

Walsh, Edward T. “Boolean algebras and their topological duals.” 1966. Masters Thesis, Montana Tech. Accessed August 15, 2020. https://scholarworks.umt.edu/etd/8035.

MLA Handbook (7th Edition):

Walsh, Edward T. “Boolean algebras and their topological duals.” 1966. Web. 15 Aug 2020.

Vancouver:

Walsh ET. Boolean algebras and their topological duals. [Internet] [Masters thesis]. Montana Tech; 1966. [cited 2020 Aug 15]. Available from: https://scholarworks.umt.edu/etd/8035.

Council of Science Editors:

Walsh ET. Boolean algebras and their topological duals. [Masters Thesis]. Montana Tech; 1966. Available from: https://scholarworks.umt.edu/etd/8035


University of Oklahoma

23. Teska, John Thomas. A binary representation for finite Boolean functions.

Degree: PhD, 1970, University of Oklahoma

Subjects/Keywords: Mathematics.; Algebra, Boolean.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Teska, J. T. (1970). A binary representation for finite Boolean functions. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/2897

Chicago Manual of Style (16th Edition):

Teska, John Thomas. “A binary representation for finite Boolean functions.” 1970. Doctoral Dissertation, University of Oklahoma. Accessed August 15, 2020. http://hdl.handle.net/11244/2897.

MLA Handbook (7th Edition):

Teska, John Thomas. “A binary representation for finite Boolean functions.” 1970. Web. 15 Aug 2020.

Vancouver:

Teska JT. A binary representation for finite Boolean functions. [Internet] [Doctoral dissertation]. University of Oklahoma; 1970. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11244/2897.

Council of Science Editors:

Teska JT. A binary representation for finite Boolean functions. [Doctoral Dissertation]. University of Oklahoma; 1970. Available from: http://hdl.handle.net/11244/2897


Columbia University

24. Xie, Jinyu. Property Testing of Boolean Function.

Degree: 2018, Columbia University

 The field of property testing has been studied for decades, and Boolean functions are among the most classical subjects to study in this area. In… (more)

Subjects/Keywords: Computer science; Algebra, Boolean; Distribution (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xie, J. (2018). Property Testing of Boolean Function. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D86X0TGD

Chicago Manual of Style (16th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Doctoral Dissertation, Columbia University. Accessed August 15, 2020. https://doi.org/10.7916/D86X0TGD.

MLA Handbook (7th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Web. 15 Aug 2020.

Vancouver:

Xie J. Property Testing of Boolean Function. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Aug 15]. Available from: https://doi.org/10.7916/D86X0TGD.

Council of Science Editors:

Xie J. Property Testing of Boolean Function. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D86X0TGD


University of Toronto

25. Le, Bao. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.

Degree: 2012, University of Toronto

With the growing complexity of modern VLSI designs, design errors become increasingly common. Design debugging today emerges as a bottleneck in the design flow, consuming… (more)

Subjects/Keywords: Design Debugging; Boolean Satisfiability; CAD; 0544

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Le, B. (2012). SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/33304

Chicago Manual of Style (16th Edition):

Le, Bao. “SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.” 2012. Masters Thesis, University of Toronto. Accessed August 15, 2020. http://hdl.handle.net/1807/33304.

MLA Handbook (7th Edition):

Le, Bao. “SAT-based Automated Design Debugging: Improvements and Application to Low-power Design.” 2012. Web. 15 Aug 2020.

Vancouver:

Le B. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. [Internet] [Masters thesis]. University of Toronto; 2012. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1807/33304.

Council of Science Editors:

Le B. SAT-based Automated Design Debugging: Improvements and Application to Low-power Design. [Masters Thesis]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/33304


University of Manchester

26. Tian, Kun. Logical models of DNA damage induced pathways to cancer.

Degree: PhD, 2013, University of Manchester

 Chemotherapy is commonly used in cancer treatments, however only 25% of cancers are responsive and a significant proportion develops resistance. The p53 tumour suppressor is… (more)

Subjects/Keywords: 616.99; Cancer; System Biology; p53; Boolean Network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tian, K. (2013). Logical models of DNA damage induced pathways to cancer. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/logical-models-of-dna-damage-induced-pathways-to-cancer(4bab4869-0156-4c3c-ad93-a81363ff2d5b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607386

Chicago Manual of Style (16th Edition):

Tian, Kun. “Logical models of DNA damage induced pathways to cancer.” 2013. Doctoral Dissertation, University of Manchester. Accessed August 15, 2020. https://www.research.manchester.ac.uk/portal/en/theses/logical-models-of-dna-damage-induced-pathways-to-cancer(4bab4869-0156-4c3c-ad93-a81363ff2d5b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607386.

MLA Handbook (7th Edition):

Tian, Kun. “Logical models of DNA damage induced pathways to cancer.” 2013. Web. 15 Aug 2020.

Vancouver:

Tian K. Logical models of DNA damage induced pathways to cancer. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2020 Aug 15]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/logical-models-of-dna-damage-induced-pathways-to-cancer(4bab4869-0156-4c3c-ad93-a81363ff2d5b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607386.

Council of Science Editors:

Tian K. Logical models of DNA damage induced pathways to cancer. [Doctoral Dissertation]. University of Manchester; 2013. Available from: https://www.research.manchester.ac.uk/portal/en/theses/logical-models-of-dna-damage-induced-pathways-to-cancer(4bab4869-0156-4c3c-ad93-a81363ff2d5b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.607386


University of Oxford

27. Petke, Justyna. On the bridge between constraint satisfaction and Boolean satisfiability.

Degree: PhD, 2012, University of Oxford

 A wide range of problems can be formalized as a set of constraints that need to be satisfied. In fact, such a model is called… (more)

Subjects/Keywords: 511.324; Computer Science; constraint satisfaction; Boolean satisfiability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Petke, J. (2012). On the bridge between constraint satisfaction and Boolean satisfiability. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891

Chicago Manual of Style (16th Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Doctoral Dissertation, University of Oxford. Accessed August 15, 2020. http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

MLA Handbook (7th Edition):

Petke, Justyna. “On the bridge between constraint satisfaction and Boolean satisfiability.” 2012. Web. 15 Aug 2020.

Vancouver:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2020 Aug 15]. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891.

Council of Science Editors:

Petke J. On the bridge between constraint satisfaction and Boolean satisfiability. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:53bf6d0e-74eb-4c50-a1a2-c8da6773beae ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572891


Rutgers University

28. Gilmer, Justin, 1986-. Discrete local central limit theorems and boolean function complexity measures.

Degree: PhD, Mathematics, 2015, Rutgers University

This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local central limit theorems, and three chapters relate to various… (more)

Subjects/Keywords: Central limit theorem; Algebra, Boolean; Combinatorial analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gilmer, Justin, 1. (2015). Discrete local central limit theorems and boolean function complexity measures. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46347/

Chicago Manual of Style (16th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Doctoral Dissertation, Rutgers University. Accessed August 15, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

MLA Handbook (7th Edition):

Gilmer, Justin, 1986-. “Discrete local central limit theorems and boolean function complexity measures.” 2015. Web. 15 Aug 2020.

Vancouver:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Aug 15]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/.

Council of Science Editors:

Gilmer, Justin 1. Discrete local central limit theorems and boolean function complexity measures. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46347/


Rice University

29. Martinelli Tabajara, Lucas. BDD-Based Boolean Synthesis.

Degree: MS, Engineering, 2018, Rice University

 Synthesizing a Boolean function satisfying a given relation between inputs and outputs is a problem with many applications in the verification and design of hardware… (more)

Subjects/Keywords: Boolean synthesis; Binary Decision Diagrams; Factored representation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Martinelli Tabajara, L. (2018). BDD-Based Boolean Synthesis. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105515

Chicago Manual of Style (16th Edition):

Martinelli Tabajara, Lucas. “BDD-Based Boolean Synthesis.” 2018. Masters Thesis, Rice University. Accessed August 15, 2020. http://hdl.handle.net/1911/105515.

MLA Handbook (7th Edition):

Martinelli Tabajara, Lucas. “BDD-Based Boolean Synthesis.” 2018. Web. 15 Aug 2020.

Vancouver:

Martinelli Tabajara L. BDD-Based Boolean Synthesis. [Internet] [Masters thesis]. Rice University; 2018. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/1911/105515.

Council of Science Editors:

Martinelli Tabajara L. BDD-Based Boolean Synthesis. [Masters Thesis]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105515


University of Melbourne

30. POHL, STEFAN. Boolean and ranked information retrieval for biomedical systematic reviewing.

Degree: 2012, University of Melbourne

 Evidence-based medicine seeks to base clinical decisions on the best currently available scientific evidence and is becoming accepted practice. A key role is played by… (more)

Subjects/Keywords: boolean; ranked; information retrieval; systematic reviews

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

POHL, S. (2012). Boolean and ranked information retrieval for biomedical systematic reviewing. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/37031

Chicago Manual of Style (16th Edition):

POHL, STEFAN. “Boolean and ranked information retrieval for biomedical systematic reviewing.” 2012. Doctoral Dissertation, University of Melbourne. Accessed August 15, 2020. http://hdl.handle.net/11343/37031.

MLA Handbook (7th Edition):

POHL, STEFAN. “Boolean and ranked information retrieval for biomedical systematic reviewing.” 2012. Web. 15 Aug 2020.

Vancouver:

POHL S. Boolean and ranked information retrieval for biomedical systematic reviewing. [Internet] [Doctoral dissertation]. University of Melbourne; 2012. [cited 2020 Aug 15]. Available from: http://hdl.handle.net/11343/37031.

Council of Science Editors:

POHL S. Boolean and ranked information retrieval for biomedical systematic reviewing. [Doctoral Dissertation]. University of Melbourne; 2012. Available from: http://hdl.handle.net/11343/37031

[1] [2] [3] [4] [5] … [14]

.