Mladen Mikša

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds	2024	Mladen Mikša Jakob Nordström
+ PDF Chat	From Small Space to Small Width in Resolution	2015	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds	2015	Mladen Mikša Jakob Nordström
+	A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds	2015	Mladen Mikša Jakob Nordström
+	From Small Space to Small Width in Resolution	2014	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	From Small Space to Small Width in Resolution	2014	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+ PDF Chat	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds	2013	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals
+	Review of mathematics for the analysis of algorithms by Daniel H. Greene and Donald E. Knuth	2011	Mladen Mikša

Common Coauthors

Coauthor	Papers Together
Jakob Nordström	7
Marc Vinyals	4
Massimo Lauria	4
Yuval Filmus	4

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Pebble Games, Proof Complexity, and Time-Space Trade-offs	2013	Jakob Nordström	3
+	Lower bounds for polynomial calculus: non-binomial case	2001	M. Alekhnovich Alexander Razborov	2
+ PDF Chat	Resolution lower bounds for perfect matching principles	2004	Alexander Razborov	2
+ PDF Chat	On the weak pigeonhole principle	2001	Jan Krajı́ček	2
+	A complex-number Fourier technique for lower bounds on the Mod-m degree	2000	F. Green	2
+ PDF Chat	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds	2013	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals	2
+	Resolution lower bounds for the weak functional pigeonhole principle	2003	Alexander Razborov	2
+	Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q	1994	Moshe Morgenstern	1
+	Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs	2001	Jeong Han Kim Nicholas Wormald	1
+	Possible Research Directions	2019	Vesna Todorčević	1
+	Another look at degree lower bounds for polynomial calculus	2019	Yuval Filmus	1
+	Models of Random Regular Graphs	1999	N. C. Wormald	1
+	Edge-isoperimetric inequalities in the grid	1991	B�la Bollob�s Imre Leader	1
+	Random Cnf’s are Hard for the Polynomial Calculus	2010	Eli Ben‐Sasson Russell Impagliazzo	1
+	On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies	2016	Lorenzo Carlucci Nicola Galesi Massimo Lauria	1
+ PDF Chat	The complexity of proving that a graph is Ramsey	2016	Massimo Lauria Pavel Pudlák Vojtěch Rödl Neil Thapen	1
+ PDF Chat	Proof Complexity Meets Algebra	2018	Albert Atserias Joanna Ochremiak	1
+	The Isoperimetric Number of Random Regular Graphs	1988	Béla Bollobás	1
+ PDF Chat	A lower bound on the size of resolution proofs of the Ramsey theorem	2012	Pavel Pudlák	1
+ PDF Chat	Narrow Proofs May Be Maximally Long	2014	Albert Atserias Massimo Lauria Jakob Nordström	1
+	From Small Space to Small Width in Resolution	2014	Yuval Filmus Massimo Lauria Mladen Mikša Jakob Nordström Marc Vinyals	1