Pavel Hrubes

	2012
24		Pavel Hrubes, Iddo Tzameret: Short proofs for the determinant identities. STOC 2012: 193-212
23		Pavel Hrubes, Amir Yehudayoff: Formulas are exponentially stronger than monotone circuits in non-commutative setting. Electronic Colloquium on Computational Complexity (ECCC) 19: 61 (2012)
22		Pavel Hrubes: On the nonnegative rank of distance matrices. Inf. Process. Lett. 112(11): 457-461 (2012)
	2011
21		Pavel Hrubes, Iddo Tzameret: Short Proofs for the Determinant Identities CoRR abs/1112.6265: (2011)
20		Pavel Hrubes, Amir Yehudayoff: Homogeneous Formulas and Symmetric Polynomials. Computational Complexity 20(3): 559-578 (2011)
19		Pavel Hrubes, Iddo Tzameret: Short Proofs for the Determinant Identities. Electronic Colloquium on Computational Complexity (ECCC) 18: 174 (2011)
18		Pavel Hrubes: How much commutativity is needed to prove polynomial identities? Electronic Colloquium on Computational Complexity (ECCC) 18: 88 (2011)
17		Pavel Hrubes, Amir Yehudayoff: Arithmetic Complexity in Ring Extensions. Theory of Computing 7(1): 119-129 (2011)
	2010
16		Pavel Hrubes, Avi Wigderson, Amir Yehudayoff: Relationless Completeness and Separations. IEEE Conference on Computational Complexity 2010: 280-290
15		Pavel Hrubes, Avi Wigderson, Amir Yehudayoff: Non-commutative circuits and the sum-of-squares problem. STOC 2010: 667-676
14		Pavel Hrubes, Avi Wigderson, Amir Yehudayoff: Non-commutative circuits and the sum-of-squares problem. Electronic Colloquium on Computational Complexity (ECCC) 17: 21 (2010)
13		Pavel Hrubes, Avi Wigderson, Amir Yehudayoff: Relationless completeness and separations. Electronic Colloquium on Computational Complexity (ECCC) 17: 40 (2010)
12		Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák: On convex complexity measures. Theor. Comput. Sci. 411(16-18): 1842-1854 (2010)
	2009
11		Pavel Hrubes, Premysl Derbek: Emission load estimation and modeling in relation to the real input traffic data. EATIS 2009: 14
10		Pavel Hrubes, Iddo Tzameret: The Proof Complexity of Polynomial Identities. IEEE Conference on Computational Complexity 2009: 41-51
9		Pavel Hrubes: On lengths of proofs in non-classical logics. Ann. Pure Appl. Logic 157(2-3): 194-205 (2009)
8		Pavel Hrubes, Amir Yehudayoff: Homogeneous formulas and symmetric polynomials CoRR abs/0907.2621: (2009)
7		Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák: On convex complexity measures. Electronic Colloquium on Computational Complexity (ECCC) 16: 40 (2009)
6		Pavel Hrubes, Amir Yehudayoff: Monotone separations for constant degree polynomials. Inf. Process. Lett. 110(1): 1-3 (2009)
5		Pavel Hrubes: Kreisel's Conjecture with minimality principle. J. Symb. Log. 74(3): 976-988 (2009)
	2007
4		Pavel Hrubes: A lower bound for intuitionistic logic. Ann. Pure Appl. Logic 146(1): 72-90 (2007)
3		Pavel Hrubes: Theories very close to PA where Kreisel's Conjecture is false. J. Symb. Log. 72(1): 123-137 (2007)
2		Pavel Hrubes: Lower bounds for modal logics. J. Symb. Log. 72(3): 941-958 (2007)
	2004
1		Pavel Hrubes, Josef Faber, Mirko Novak: Analysis of EEG signals during micro-sleeps. SMC (4) 2004: 3775-3780

Coauthor Index

1	Premysl Derbek	[11]
2	Josef Faber	[1]
3	Stasys Jukna	[7] [12]
4	Alexander S. Kulikov	[7] [12]
5	Mirko Novak	[1]
6	Pavel Pudlák	[7] [12]
7	Iddo Tzameret	[10] [19] [21] [24]
8	Avi Wigderson	[13] [14] [15] [16]
9	Amir Yehudayoff	[6] [8] [13] [14] [15] [16] [17] [20] [23]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page