# Pavel Hrubes

According to our database

Collaborative distances:

^{1}, Pavel Hrubes authored at least 38 papers between 2004 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

On the complexity of computing a random Boolean function over the reals.

Electronic Colloquium on Computational Complexity (ECCC), 2019

On $\epsilon$-sensitive monotone computations.

Electronic Colloquium on Computational Complexity (ECCC), 2019

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits.

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

A note on monotone real circuits.

Inf. Process. Lett., 2018

2017

On Families of Anticommuting Matrices.

FLAP, 2017

A note on monotone real circuits.

Electronic Colloquium on Computational Complexity (ECCC), 2017

Random Formulas, Monotone Circuits, and Interpolation.

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

On Hardness of Multilinearization and VNP-Completeness in Characteristic 2.

TOCT, 2016

Semantic Versus Syntactic Cutting Planes.

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On Isoperimetric Profiles and Computational Complexity.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

On hardness of multilinearization, and VNP completeness in characteristics two.

Electronic Colloquium on Computational Complexity (ECCC), 2015

Dopravní nehoda, systémový model a shluková analýza v prostředí GIS.

Acta Informatica Pragensia, 2015

Circuits with Medium Fan-In.

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Total Maps of Turing Categories.

Electr. Notes Theor. Comput. Sci., 2014

Non-commutative arithmetic circuits with division.

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

On the Real τ-Conjecture and the Distribution of Complex Roots.

Theory of Computing, 2013

A note on semantic cutting planes.

Electronic Colloquium on Computational Complexity (ECCC), 2013

Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting.

Proceedings of the 28th Conference on Computational Complexity, 2013

2012

On the nonnegative rank of distance matrices.

Inf. Process. Lett., 2012

Timed Sets, Functional Complexity, and Computability.

Electr. Notes Theor. Comput. Sci., 2012

A note on the real $\tau$-conjecture and the distribution of roots.

Electronic Colloquium on Computational Complexity (ECCC), 2012

Short proofs for the determinant identities.

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Arithmetic Complexity in Ring Extensions.

Theory of Computing, 2011

How much commutativity is needed to prove polynomial identities?

Electronic Colloquium on Computational Complexity (ECCC), 2011

Homogeneous Formulas and Symmetric Polynomials.

Computational Complexity, 2011

2010

On convex complexity measures.

Theor. Comput. Sci., 2010

Non-commutative circuits and the sum-of-squares problem.

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Relationless Completeness and Separations.

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2009

Kreisel's Conjecture with minimality principle.

J. Symb. Log., 2009

Monotone separations for constant degree polynomials.

Inf. Process. Lett., 2009

On convex complexity measures.

Electronic Colloquium on Computational Complexity (ECCC), 2009

On lengths of proofs in non-classical logics.

Ann. Pure Appl. Logic, 2009

Emission load estimation and modeling in relation to the real input traffic data.

Proceedings of the 2009 Euro American conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship, 2009

The Proof Complexity of Polynomial Identities.

Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2007

Lower bounds for modal logics.

J. Symb. Log., 2007

Theories very close to

*PA*where Kreisel's Conjecture is false.
J. Symb. Log., 2007

A lower bound for intuitionistic logic.

Ann. Pure Appl. Logic, 2007

2004

Analysis of EEG signals during micro-sleeps.

Proceedings of the IEEE International Conference on Systems, 2004