|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 4 keywords
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pavel Hrubes |
On the nonnegative rank of distance matrices.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Iddo Tzameret |
Short proofs for the determinant identities. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes |
How much commutativity is needed to prove polynomial identities? |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Iddo Tzameret |
Short Proofs for the Determinant Identities. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Amir Yehudayoff |
Arithmetic Complexity in Ring Extensions. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Amir Yehudayoff |
Homogeneous Formulas and Symmetric Polynomials. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Iddo Tzameret |
Short Proofs for the Determinant Identities |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Non-commutative circuits and the sum-of-squares problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Relationless completeness and separations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák |
On convex complexity measures. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Relationless Completeness and Separations. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Completeness, Separations, Algebraic complexity |
| 1 | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
Non-commutative circuits and the sum-of-squares problem. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
lower bounds, algebraic complexity |
| 1 | Pavel Hrubes, Amir Yehudayoff |
Monotone separations for constant degree polynomials. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák |
On convex complexity measures. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes |
Kreisel's Conjecture with minimality principle. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes |
On lengths of proofs in non-classical logics. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Amir Yehudayoff |
Homogeneous formulas and symmetric polynomials |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes, Premysl Derbek |
Emission load estimation and modeling in relation to the real input traffic data. |
EATIS |
2009 |
DBLP DOI BibTeX RDF |
emission factor, road inclination, toll highway system, traffic intensity estimation, weather module |
| 1 | Pavel Hrubes, Iddo Tzameret |
The Proof Complexity of Polynomial Identities. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes |
Theories very close to PA where Kreisel's Conjecture is false. |
J. Symb. Log. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes |
Lower bounds for modal logics. |
J. Symb. Log. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pavel Hrubes |
A lower bound for intuitionistic logic. |
Ann. Pure Appl. Logic |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Josef Faber, Mirko Novak |
Analysis of EEG signals during micro-sleeps. |
SMC |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")