Pavel Hrubes

发表

On isoperimetric profiles and computational complexity

Amir Yehudayoff, Pavel Hrubes, 2015, Electron. Colloquium Comput. Complex..

A learning problem that is independent of the set theory ZFC axioms pdf

Shai Ben-David, Shay Moran, Amir Yehudayoff, 2017, ArXiv.

Homogeneous Formulas and Symmetric Polynomials

Amir Yehudayoff, Pavel Hrubes, 2011, computational complexity.

Short Proofs for the Determinant Identities

Iddo Tzameret, Pavel Hrubes, 2015, SIAM J. Comput..

On lengths of proofs in non-classical logics

Pavel Hrubes, P. Hrubes, 2009, Ann. Pure Appl. Log..

Short proofs for the determinant identities

Iddo Tzameret, Pavel Hrubes, 2012, STOC '12.

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

Pavel Hrubes, 2019, Electron. Colloquium Comput. Complex..

Circuits with Medium Fan-In

Anup Rao, Pavel Hrubes, 2015, Computational Complexity Conference.

Theories very close to PA where Kreisel's Conjecture is false

Pavel Hrubes, 2007, J. Symb. Log..

On the nonnegative rank of distance matrices

Pavel Hrubes, P. Hrubes, 2012, Inf. Process. Lett..

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

Pavel Hrubes, Veronika Vlcková, 2015, Acta Informatica Pragensia.

Non-commutative arithmetic circuits with division

Avi Wigderson, Pavel Hrubes, A. Wigderson, 2014, Theory Comput..

On families of anticommuting matrices

Pavel Hrubes, 2017, FLAP.

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

Pavel Hrubes, 2013, Theory Comput..

On the distribution of runners on a circle

Pavel Hrubes, 2020, Eur. J. Comb..

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

Pavel Hrubes, 2012, Electron. Colloquium Comput. Complex..

Total Maps of Turing Categories

J. Robin B. Cockett, Pieter J. W. Hofstra, Pavel Hrubes, 2014, MFPS.

On $\epsilon$-sensitive monotone computations

Pavel Hrubes, 2019, Electron. Colloquium Comput. Complex..

Lower bounds for modal logics

Pavel Hrubes, P. Hrubes, 2007, Journal of Symbolic Logic.

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits

Anup Rao, Amir Yehudayoff, Pavel Hrubes, 2019, Electron. Colloquium Comput. Complex..

A note on semantic cutting planes

Pavel Hrubes, 2013, Electron. Colloquium Comput. Complex..

Monotone separations for constant degree polynomials

Amir Yehudayoff, Pavel Hrubes, 2009, Inf. Process. Lett..

Non-commutative arithmetic circuits with division

Avi Wigderson, Pavel Hrubes, A. Wigderson, 2014, Theory of Computing.

Arithmetic Complexity in Ring Extensions

Amir Yehudayoff, Pavel Hrubes, A. Yehudayoff, 2011, Theory Comput..

Random Formulas, Monotone Circuits, and Interpolation

Pavel Pudlák, Pavel Hrubes, P. Pudlák, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Analysis of EEG signals during micro-sleeps

Pavel Hrubes, Mirko Novák, Josef Faber, 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

Kreisel's Conjecture with minimality principle

Pavel Hrubes, 2009, J. Symb. Log..

Timed Sets, Functional Complexity, and Computability

J. Robin B. Cockett, Pavel Hrubes, Jonathan Gallagher, 2012, MFPS.

On Hardness of Multilinearization and VNP-Completeness in Characteristic 2

Pavel Hrubes, 2015, Electron. Colloquium Comput. Complex..

Relationless Completeness and Separations

Avi Wigderson, Amir Yehudayoff, Pavel Hrubes, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

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

Amir Yehudayoff, Pavel Hrubes, 2013, 2013 IEEE Conference on Computational Complexity.

A note on monotone real circuits

Pavel Pudlák, Pavel Hrubes, 2018, Inf. Process. Lett..

Semantic Versus Syntactic Cutting Planes

Yuval Filmus, Massimo Lauria, Pavel Hrubes, 2016, STACS.

How much commutativity is needed to prove polynomial identities?

Pavel Hrubes, 2011, Electron. Colloquium Comput. Complex..

Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm

Pavel Hrubes, Lindyanne Alexander, Linda Sharp, 2022 .

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

Avi Wigderson, Amir Yehudayoff, Pavel Hrubes, 2010, STOC '10.

The Proof Complexity of Polynomial Identities

Iddo Tzameret, Pavel Hrubes, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

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

Pavel Hrubes, Premysl Derbek, 2009, EATIS.

On convex complexity measures

Pavel Pudlák, Stasys Jukna, Pavel Hrubes, 2009, Theor. Comput. Sci..

Learnability can be independent of set theory (invited paper)

Shai Ben-David, Shay Moran, Amir Yehudayoff, 2021, STOC.

On the extension complexity of polytopes separating subsets of the Boolean cube pdf

Pavel Hrubes, Navid Talebanfard, 2021, ArXiv.