Assorted results in boolean function complexity, uniform sampling and clique partitions of graphs
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020
Main Author: | Wellens, Jake(Jake Lee) |
---|---|
Other Authors: | Henry Cohn. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/126937 |
Similar Items
-
Relationships between the number of inputs and other complexity measures of Boolean functions
by: Jake Wellens
Published: (2022-12-01) -
Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01) -
Monochromatic loose paths in multicolored $k$-uniform cliques
by: Andrzej Dudek, et al.
Published: (2019-10-01) -
Edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2019) -
On NP-hardness of the clique partition : independence number gap recognition and related problems
by: Busygin, Stanislav., et al.
Published: (2012)